#include <bits/stdc++.h>

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

const int NMAX = 50005;
const int INF = (1 << 30);

int N, M;
int D[NMAX];
bool vizitat[NMAX];

vector< pair < int, int > > G[NMAX];

struct compara {
    bool operator() (int x, int y) {
        return D[x] > D[y];
    }
};

priority_queue<int, vector<int>, compara> Q;

void Read()
{
    fin >> N >> M;

    for(int i = 1; i <= M; i++) {
        int x, y, c;

        fin >> x >> y >> c;

        G[x].push_back(make_pair(y, c));
    }
}

void Dijkstra(int nodStart)
{
    for(int i = 1; i <= N; i++)
        D[i] = INF;

    D[nodStart] = 0;

    Q.push(nodStart);
    vizitat[nodStart] = true;

    while(!Q.empty()) {
        int nodCurent = Q.top();
        Q.pop();

        vizitat[nodCurent] = false;
        for(unsigned int i = 0; i < G[nodCurent].size(); i++) {
            int vecin = G[nodCurent][i].first;
            int cost = G[nodCurent][i].second;

            if(D[nodCurent] + cost < D[vecin]) {
                D[vecin] = D[nodCurent] + cost;

                if(!vizitat[vecin]) {
                    Q.push(vecin);
                    vizitat[vecin] = true;
                }
            }
        }
    }
}

void Display()
{
    for(int i = 2; i <= N; i++) {
        if(D[i] != INF)
            fout << D[i] << " ";
        else
            fout << "0 ";
    }
}

int main()
{
    Read();
    Dijkstra(1);
    Display();
}