#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <cstring>

#define Nmax 50005
#define INF 0x3f3f3f3f

using namespace std;
int N,M;
vector<pair<int,int> > G[Nmax];
int D[Nmax];
priority_queue<pair<int,int>,vector<pair<int,int> > , greater<pair<int,int> > > Q;

void read()
{
    scanf("%d%d",&N,&M);
    int a,b,c;
    for(int i = 1; i <= M; ++i)
    {
        scanf("%d %d %d",&a,&b,&c);
        G[a].push_back(make_pair(c,b));
    }
}

void dijkstra(int k)
{
    memset(D,INF,sizeof(D));
    D[1] = 0;
    Q.push(make_pair(0,1));
    while(!Q.empty())
    {
        k = Q.top().second;
        Q.pop();
        for(vector<pair<int,int> >::iterator it = G[k].begin(); it != G[k].end(); ++it )
            if(D[it->second] > D[k] + it->first)
            {
                D[it->second] = D[k] + it->first;
                Q.push(make_pair(D[it->second],it->second));
            }
    }
    for(int i = 2; i <= N; ++i)
        if(D[i] == INF)
            printf("0 ");
        else
            printf("%d ",D[i]);
}

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

    return 0;
}