#include <bits/stdc++.h>

using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

const int NMax = 50003;
const int INF = 0x3f3f3f3f;

int n,m,x,y,c;
int dist[NMax];
queue<int> q;
vector<pair<int,int> > G[NMax];

int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; ++i){
        f >> x >> y >> c;
        G[x].push_back(make_pair(y,c));
    }
    memset(dist,INF,sizeof(dist));
    q.push(1);
    dist[1] = 0;
    while(!q.empty()){
        int nod = q.front();
        q.pop();
        for(int i = 0; i < G[nod].size(); ++i){
            if(dist[G[nod][i].first] > dist[nod] + G[nod][i].second){
                dist[G[nod][i].first] = dist[nod] + G[nod][i].second;
                q.push(G[nod][i].first);
            }
        }
    }
    for(int i = 2; i <= n; ++i){
        if(dist[i] == INF){
            g << 0 << ' ';
        }else
            g << dist[i] << ' ';
    }
    return 0;
}