#include <bits/stdc++.h>

using namespace std;

#define N 50005
#define M 250005
#define INF 1000000000

int d[N], vf[M], urm[M], lst[N], cst[M], nr, n;

void add_graph(int x, int y, int c) {
    vf[++nr] = y;
    cst[nr] = c;
    urm[nr] = lst[x];
    lst[x] = nr;
}

typedef pair<int, int> iPair;

void dijkstra() {
    priority_queue< iPair, vector<iPair>, greater<iPair> > pq;
    d[1] = 0;
    for(int i = 2; i <= n; ++i)
        d[i] = INF;

    pq.push(make_pair(d[1], 1));
    while(!pq.empty()) {
        int x = pq.top().second;
        pq.pop();
        for(int p = lst[x]; p; p = urm[p]) {
            int y = vf[p], c = cst[p];
            if(d[x] + c < d[y]) {
                d[y] = d[x] + c;
                pq.push(make_pair(d[y], y));
            }
        }
    }
 }

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

    int m, x, y, z;
    fin >> n >> m; do {
        fin >> x >> y >> z;
        add_graph(x, y, z);
    } while(--m);
    dijkstra();
    for(int i = 2; i <= n; ++i)
        fout << d[i] << ' ';
    return 0;
}