#include <iostream>
#include <fstream>
using namespace std;
int n,m,i,inf=16500,d[50001],viz[50001],x,y,c,pred[50001];
struct nod{
int x,c;
nod *urm;}*p,*v[50001];
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
void minim(int &k)
{
    int i,mini=2*inf;
    for(i=1;i<=n;i++)
        if(d[i]<mini&&viz[i]==0)
    {
        mini=d[i];
        k=i;
    }
}
void dijkstra()
{
    int nr,k,OK;
    nod *p;
    x=1;
    viz[x]=1;nr=1;OK=1;
    while(nr<n&&OK)
    {
        minim(k);
        if(d[k]==inf)
            OK=0;
        else
        {
            viz[k]=1;nr++;
            p=v[k];
            while(p!=NULL)
            {
                if(viz[p->x]==0)
                {
                    if(d[k]+p->c<d[p->x])
                    {
                        d[p->x]=d[k]+p->c;
                        pred[p->x]=k;
                    }
                }
                p=p->urm;
            }
        }
    }
}
void adaug(nod *&p,int x,int c)
{
    nod *q,*u;
    q=new nod;
    q->x=x;
    q->c=c;
    q->urm=NULL;
    if(p==NULL)
        p=q;
    else
    {
        u=p;
        while(u->urm!=NULL)
            u=u->urm;
        u->urm=q;
    }
}
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        adaug(v[x],y,c);
        adaug(v[y],x,c);
    }
    for(i=1;i<=n;i++)
        d[i]=inf;
    p=v[1];
    while(p!=NULL)
    {
        d[p->x]=p->c;
        pred[p->x]=1;
        p=p->urm;
    }
    dijkstra();
    for(i=2;i<=n;i++)
    {
        if(d[i]==inf)g<<0<<" ";
        else
            g<<d[i]<<" ";
    }
    return 0;
}