#include <bits/stdc++.h>

using namespace std;

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

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

int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i = 1; i <= m; ++i){
        scanf("%d%d%d",&x,&y,&c);
        G[x].push_back(make_pair(y,c));
    }
    memset(dist,INF,sizeof(dist));
    q.push(make_pair(0,1));
    dist[1] = 0;
    while(!q.empty()){
        int nod = q.top().second;
        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(make_pair(dist[G[nod][i].first],G[nod][i].first));
            }
        }
    }
    for(int i = 2; i <= n; ++i){
        if(dist[i] == INF){
            printf("0 ");
        }else
            printf("%d ",dist[i]);
    }
    return 0;
}