#include <bits/stdc++.h>

using namespace std;

#define N 50005
#define M 250005

const int INF = INT_MAX;
int vf[M], cst[M], urm[M], lst[N], n, nr;

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

int d[N];
typedef pair<int, int> p_int;
void dijkstra() {
    priority_queue< p_int, vector<p_int>, greater<p_int> > pq;
    pq.push(make_pair(0, 1));

    d[1] = 0;
    for(int i = 2; i <= n; ++i)
        d[i] = INF;

    do {
        int x = pq.top().second;
        pq.pop();

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

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] == INF ? 0 : d[i]) << ' ';
}