#include <iostream>
#include <bits/stdc++.h>

using namespace std;

#define pb push_back

const int INF = 2e9;

int n, m;
vector <int> dist;
vector <vector <pair <int, int> > > graph;
priority_queue <pair <int, int > > pq;

void dijkstra(int start)
{
    dist[start] = 0;
    pq.push({-dist[start], start});

    while(!pq.empty())
    {
        int node = pq.top().second;
        pq.pop();

        for (auto x : graph[node])
        if(dist[x.first] > dist[node] + x.second)
        {
            dist[x.first] = dist[node] + x.second;
            pq.push({-dist[node], x.first});
        }
    }
}

int main()
{
    ios_base :: sync_with_stdio(0);
    cin.tie(0);

    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);

    cin >> n >> m;

    graph.resize(n + 1);
    dist.resize(n + 1, INF);

    for(int i = 1; i <= m; i ++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        graph[a].pb({b, c});
    }

    dijkstra(1);

    for(int i = 2; i <= n; i ++)
    {
        if(dist[i] == INF)
            cout << 0 << " ";
        else
            cout << dist[i] << " ";
    }
    return 0;
}