#include <bits/stdc++.h>
#define INF 1500000000

std::priority_queue <std::pair<int, int>> pq;
std::vector<std::pair<int, int>> graph[50001];
int dist[50001];
bool folosit[50001];

int main(){
    FILE *fin, *fout;
    int n, m, i, c, a, b, x, dx, y, dxy;
    fin=fopen("dijkstra.in", "r");
    fout=fopen("dijkstra.out", "w");
    fscanf(fin, "%d%d", &n, &m);
    for(i=0;i<m;i++){
        fscanf(fin, "%d%d%d", &a, &b, &c);
        graph[a].push_back({c, b});
    }
    for(i=1;i<=n;i++)
        dist[i]=INF;
    dist[1]=0;
    pq.push({-dist[1], 1});
    while(!pq.empty()){
        while(!pq.empty() && folosit[pq.top().second])
            pq.pop();
        if(!pq.empty()){
            dx=-pq.top().first;
            x=pq.top().second;
            folosit[x]=1;
            //printf("%d %d\n", dx, x);
            for(i=0;i<graph[x].size();i++){
                dxy=graph[x][i].first;
                y=graph[x][i].second;
                if(dist[x]+dxy<dist[y]){
                    dist[y]=dist[x]+dxy;
                    pq.push({-dist[y], y});
                }
            }
        }
    }
    for(i=2;i<=n;i++){
        if(dist[i]==INF)
            fprintf(fout, "0 ");
        else
            fprintf(fout, "%d ", dist[i]);
    }
    fclose(fin);
    fclose(fout);

    return 0;
}