#include<iostream>
#include<cstdio>
#include<queue>
#include<vector>
#include<bitset>
#define INF 0x3f3f3f3f
#define mp make_pair
#define pb push_back
#define maxn 50010
using namespace std;
vector < pair < int, int > > G[maxn];
queue < int > q;
int d[maxn],n,m,x,y,cost,i;

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,&cost),G[x].pb(mp(y,cost));
    for(i=2; i<=n; ++i)
        d[i] = INF;
    q.push(1);
    while(!q.empty())
    {
        x=q.front();
        for(i=0; i<G[x].size(); ++i)
        {
            y=G[x][i].first;
            cost=G[x][i].second;
            if(d[y] > d[x] + cost)
                d[y] = d[x] + cost, q.push(y);
        }
        q.pop();
    }
    for(i=2; i<=n; ++i)
        printf("%d ",d[i]);
    return 0;
}