#include<stdio.h>
#include<queue>
#define INF 1000001
#define Nmx 50002

using namespace std;

struct nod
{
    int inf,cost;
    nod *urm;
};
nod *G[Nmx];

int n,m,viz[Nmx],nr,cost[Nmx];

void add(int x,int y,int c)
{
    nod *aux=new nod;
    aux->inf=y;
    aux->cost=c;
    aux->urm=G[x];
    G[x]=aux;
}

void citire()
{
    scanf("%d%d",&n,&m);
    int x,y,c;
    for(int i=1;i<=m;++i)
    {
        scanf("%d%d%d",&x,&y,&c);
        add(x,y,c);
    }
}

struct cmp
{
    bool operator()(const int &a,const int &b) const
    {
        return cost[a]>cost[b];
    }
};
priority_queue<int, vector<int>, cmp> Q;

void solve()
{
    for(int i=2;i<=n;++i)
        cost[i]=INF;
    Q.push(1);
    while(!Q.empty())
    {
        int min=Q.top();
        Q.pop();
        viz[min]=0;
        for(nod *p=G[min];p;p=p->urm)
            if(cost[p->inf]>cost[min]+p->cost)
            {
                cost[p->inf]=cost[min]+p->cost;
                if(!viz[p->inf])
                {
                    Q.push(p->inf);
                    viz[p->inf]=nr;
                }
            }
    }
    for(int i=2;i<=n;++i)
        if(cost[i]!=INF)    printf("%d ",cost[i]);
        else printf("0 ");
    printf("\n");
}

int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    citire();
    solve();
    return 0;
}