#include <bits/stdc++.h>
#define NMAX 50001
#define INF 1<<30

using namespace std;

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

int n, m, a, b, c;
vector<int> G[NMAX], C[NMAX];
queue<int> Q;
int dmin[NMAX];

void bellmanFord(int node) {
    Q.push(node);
    while(!Q.empty()) {
        int x = Q.front();
        Q.pop();
        for(int i = 0; i < G[x].size(); i++) {
            if(dmin[x] + C[x][i] < dmin[G[x][i]]) {
                dmin[G[x][i]] = dmin[x] + C[x][i];
                Q.push(G[x][i]);
            }
        }
    }
}

int main()
{
    fin >> n >> m;
    for(int i = 2; i <= n; i++) dmin[i] = INF;
    while(m--) {
        fin >> a >> b >> c;
        G[a].push_back(b);
        C[a].push_back(c);
    }
    bellmanFord(1);
    for(int i = 2; i <= n; i++) {
        if(dmin[i] == INF) fout << 0 << ' ';
        else fout << dmin[i] << ' ';
    }
    return 0;
}