#include <stdio.h>
#include<vector>
#include<queue>
#define inf 9999999
#define pp pair<int,int>
using namespace std;
vector<pp> a[50001];
priority_queue<pp,vector<pp>,greater<pp> >q;
int n,m,d[50001];
void cit(){
    int i,j,h,w;
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%i%i",&n,&m);
    for(h=1;h<=m;h++){
        scanf("%i%i%i",&i,&j,&w);
        a[i].push_back(pp(j,w));
    }
}
void dijkstra(){
    int i,x,y,k;
    pp p;
    for(i=1;i<=n;i++)
        d[i]=inf;
    d[1]=0;
    q.push(make_pair(0,1));
    while(!q.empty()){
        p=q.top();
        q.pop();
        k=p.second;
        if(d[k]!=p.first)
            continue;
        for(i=0;i<a[k].size();i++){
            x=a[k][i].first;
            y=a[k][i].second;
            if(d[x]>d[k]+y){
                d[x]=d[k]+y;
                q.push(make_pair(d[x],x));
            }
        }
    }
}
int main(){
    cit();
    dijkstra();
    int i;
    for(i=2;i<=n;i++)
        if(d[i]!=inf)
            printf("%i ",d[i]);
        else
            printf("%i ",0);
    return 0;
}