#include<iostream>
#include<cstdio>
#include<queue>
#include<vector>
#define maxn 50100
#define INF 0x3f3f3f3f
using namespace std;
queue < int > q;
vector < int > G[maxn],C[maxn];
int i,n,m,x,y,c,d[maxn];
int main()
{
    freopen("dijkstra.in", "rt", stdin);
    freopen("dijkstra.out", "wt", stdout);
    scanf("%d%d",&n,&m);
    for(i=2; i<=n; ++i)
        d[i]=INF;
    while(m--)
        scanf("%d%d%d",&x,&y,&c),G[x].push_back(y),C[x].push_back(c);
    q.push(1);
    while(!q.empty())
    {
        x=q.front();
        for(i=0; i<G[x].size(); ++i)
            if(d[G[x][i]] > d[x] + C[x][i])
                d[G[x][i]] = d[x] + C[x][i], q.push(G[x][i]);
        q.pop();
    }
    for(i = 2; i <= n; i++)
        printf("%d ", d[i] == INF ? 0 : d[i]);
    return 0;
}