#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
const int N=50001,I=1<<30;
vector<int> a[N],b[N],h[N],p[N];
int n,m,x,y,z,i,j,k,l,d[N];
int main()
{
    freopen("dijkstra.in","r",stdin),freopen("dijkstra.out","w",stdout),scanf("%d%d",&n,&m);
    while(m--)
        scanf("%d%d%d",&x,&y,&z),a[x].push_back(y),b[x].push_back(z);
    for(i=2;i<=n;i++)
        d[i]=I,p[i]=-1;
    for(h.push_back(1);k;)
    {
        i=h[1],swap(h[1],h[k--]),p[h[1]]=1,push_heap(h.begin(),h.end()),push_heap(p.begin(),p.end());
        for(l=a[i].size(),j=0;j<l;j++)
            if(d[a[i][j]]>d[i]+b[i][j])
            {
                d[a[i][j]]=d[i]+b[i][j];
                if(p[a[i][j]]!=-1)
                    push_heap(p.begin(),p.end());
                else
                    h[++k]=a[i][j],p[h[k]]=k,push_heap(h.begin(),h.end()),push_heap(p.begin(),p.end());
            }
    }
    for(i=2;i<=n;i++)
        printf("%d ",d[i]==I?0:d[i]);
}