#include<bits/stdc++.h>
using namespace std;
ifstream F("dijkstra.in");
ofstream G("dijkstra.out");
#define N 50001
vector<pair<int,int> > g[N];
int m,n,i,j,k,p[N],d[N],h[N],l,t,w,f;
int main()
{
    for(F>>n>>m;m--;F>>i>>j>>k,g[i].push_back({j,k}));
    for(i=2;i<=n;d[i]=p[i]=N,++i);
    for(k=p[1]=h[1]=1;k;) {
        for(t=h[1],h[1]=h[k--],p[h[1]]=w=1;(w<<1)<=k;swap(h[w],h[f]),p[h[w]]=w,p[h[f]]=f,w=f)
            if(f=w<<1,f<k&&d[h[f+1]]<d[h[f]]?++f:0,d[h[w]]<=d[h[f]])
                break;
        for(i=0,l=g[t].size();i<l;++i)
            if(f=g[t][i].first,w=g[t][i].second,d[f]>d[t]+w)
                for(d[f]=d[t]+w,p[f]==N?h[++k]=f,p[h[k]]=k:0,w=p[f];w>1&&d[h[w>>1]]>d[h[w]];f=w>>1,swap(h[w],h[f]),p[h[w]]=w,p[h[f]]=f,w=f);
    }
    for(i=2;i<=n;G<<(d[i]==N?0:d[i])<<' ',++i);
    return 0;
}