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

#define cost first
#define vecin second

#define Nmax 50005
#define INF 0x3f3f3f3f

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

void read( void )
{
    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( void )
{
    memset(DP,INF,sizeof(DP));
    DP[1] = 0;
    Q.push(make_pair(0,1));
    int k;
    while(!Q.empty())
    {
        k = Q.top().vecin;
        Q.pop();
        for(vector<pair<int,int> >::iterator it = G[k].begin(); it != G[k].end(); ++it)
            if(DP[it->vecin] > DP[k] + it->cost )
            {
                DP[it->vecin] = DP[k] + it->cost;
                Q.push(make_pair(-DP[it->vecin],it->vecin));
            }
    }
    for(int i = 2; i <= N; ++i)
        if(DP[i] == INF)
            printf("0 ");
        else
            printf("%d ",DP[i]);
}
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);

    read();
    dijkstra();

    return 0;
}