#include <cstdio>
#include <vector>
#include <cstring>

#define NMax 50005
#define INF 1000000000
using namespace std;

vector<pair<int,int> > vecini[NMax];
int n,m,x,y,c;

void dijkstra(int x0){
    int dist[NMax],viz[NMax];

    memset(viz,0,sizeof(viz));
    memset(dist,-1,sizeof(dist));
    for(int i = 0; i < vecini[x0].size(); i++){
        dist[vecini[x0][i].first] = vecini[x0][i].second;
    }
    for(int i = 1; i <= n; i++){
        if(dist[i] == -1){
            dist[i] = INF;
        }
    }
    dist[x0] = 0;
    int ok = 1;
    while(ok){
        int minim = INF,nod;
        for(int i = 1; i <= n; i ++){
            if(!viz[i] && minim > dist[i]){
                nod = i;
                minim = dist[i];
            }
        }
        viz[nod] = 1;
        if(minim != INF)
            for(int i = 0; i < vecini[nod].size(); i++){
                if(dist[vecini[nod][i].first] > dist[nod] + vecini[nod][i].second){
                    dist[vecini[nod][i].first] = dist[nod] + vecini[nod][i].second;
                }
            }
        else ok = 0;
    }
    for(int i = 2; i <= n; i++){
        if(dist[i] == INF)
            printf("0 ");
        else
            printf("%d ",dist[i]);
    }
}
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d%d",&n,&m);
    while(scanf("%d%d%d",&x,&y,&c) != EOF){
        vecini[x].push_back(make_pair(y,c));
    }
    dijkstra(1);
    return 0;
}