#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <bitset>

#define pb push_back
#define mp make_pair

using namespace std;

const int NodMax = 50005;
const int MuchMax = 250005;
const int inf = 0x3f3f3f3f;

vector < pair < int, int > > G[NodMax]; //cost si vecin
bitset < NodMax > viz;
priority_queue < pair < int, int > > Q; //cost si vecin
int dist[NodMax];
//int last[NodMax];
int N, M;

void Read()
{
    scanf("%d %d", &N, &M);

    for(int i=1; i<=M; ++i)
    {
        int nod2, cost, nod1;
        scanf("%d %d %d", &nod1, &nod2, &cost);
        G[nod1].pb(mp(cost,nod2));
    }

    memset(dist,inf,sizeof(dist));
}

void Dijkstra()
{
    dist[1] = 0;
//    last[1] = 0;
    Q.push(mp(0,1));

    while(!Q.empty())
    {
        int nodc = Q.top().second;
        int cost = -Q.top().first;
        Q.pop();

        vector < pair < int, int > > ::iterator it;

        if(cost != dist[nodc])
            continue;

        for(it=G[nodc].begin(); it!=G[nodc].end(); ++it)
            if(!viz[it->second] && dist[it->second] > cost + it->first)
        {
            dist[it->second] = cost + it->first;
           // last[it->second] = nodc;
            Q.push(mp(-dist[it->second],it->second));
        }
    }
}

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

    for(int i=2; i<=N; ++i)
        if(dist[i]!=inf)
            printf("%d ", dist[i]);
        else
            printf("%d ", 0);

    return 0;
}