#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#define NMAX 50002
#define INF 0X3F3F3F3F

using namespace std;

int n,m,dist[NMAX];
vector <pair<int,int>> g[NMAX];
priority_queue <pair<int,int>> pq;

void input()
{
    scanf("%d %d", &n, &m);
    int x,y,cost;
    for(int i = 1; i <= m; ++i)
    {
        scanf("%d %d %d", &x, &y, &cost);
        g[x].push_back({y,cost});
    }
}

void dijkstra()
{
    for(int i = 2; i <= n; ++i)
        dist[i] = INF;

    pq.push({0,1});

    int nod;
    while(not pq.empty())
    {
        nod = pq.top().second;
        pq.pop();

        for(auto i: g[nod])
            if(dist[i.first] == INF)
            {
                dist[i.first] = dist[nod] + i.second;
                pq.push({-i.second,i.first});
            }
    }
}

void output()
{
    for(int i = 2; i <= n; ++i)
        printf("%d ", dist[i] == INF ? 0 : dist[i]);
}

int main()
{
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);
    input();
    dijkstra();
    output();
    return 0;
}