#include <iostream>
#include <cstdio>
#include <queue>

using namespace std;

struct nod
{
    int inf,cos;
    nod* a;
}*p[50001];
nod*c;

int n,m;

int a[50001];
queue<int>q;

int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);

    scanf("%d %d",&n,&m);
    int x,y,z;
    for(int i=1; i<=m; i++)
    {
        scanf("%d %d %d",&x,&y,&z);
        c=new nod;
        c->inf=y;
        c->cos=z;
        c->a=p[x];
        p[x]=c;
    }

    for(int i=1; i<=n; i++)
        a[i]=2147483647;
    a[1]=0;
    q.push(1);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(c=p[x];c!=NULL;c=c->a)
        {
            if(a[c->inf]==2147483647 || a[x]+c->cos<a[c->inf])
            {
                a[c->inf]=c->cos+a[x];
                q.push(c->inf);
            }
        }
    }
    for(int i=2;i<=n;i++)
        printf("%d ",a[i]);
       // cout<<a[i]<<" ";
    return 0;
}