#include <cstdio>
#include <cstdlib>
#include <queue>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;

#define Inf 0x3f3f3f3f
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define forit(it, v) for(typeof((v).begin()) it = (v).begin(); it != (v).end(); ++ it)
#define Nmax 50010
#define PI pair<int, int>

int N, M, X, Y, C, Dist[Nmax];
vector<PI> G[Nmax];
priority_queue<PI, vector<PI>, greater<PI> > Q;

void Dijkstra()
{
    for(int i = 1; i <= N; ++ i) Dist[i] = Inf;
    Q.push(mp(0, 1));
    Dist[1] = 0;
    while(!Q.empty())
    {
        int Node = Q.top().second;
        Q.pop();
        forit(it, G[Node])
            if(Dist[it -> f] > Dist[Node] + it -> s)
            {
                Dist[it -> f] = Dist[Node] + it -> s;
                Q.push(mp(Dist[it -> f], it -> f));
            }
    }
    for(int i = 2; i <= N; ++ i)
        if(Dist[i] == Inf)
            printf("0 ");
        else
            printf("%i ", Dist[i]);
}

int main()
{
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);
    int i;
    scanf("%i %i", &N, &M);
    for(i = 1; i <= M; ++ i)
    {
        scanf("%i %i %i", &X, &Y, &C);
        G[X].pb(mp(Y, C));
    }
    Dijkstra();
    return 0;
}