#include <bits/stdc++.h>

using namespace std;

#define MAX_N 50000
const long long INF = 1e10;

int n, m;
bitset <MAX_N +1> viz;
vector <long long> dist;
vector < vector <pair <int, int> > > graph;
priority_queue <pair <long long, int> > pq;

void dijkstra(int root)
{
    dist[root] = 0;
    pq.push({0, root});
    while(!pq.empty())
    {
        pair <int, int> r;
        r = pq.top();
        pq.pop();
        int node = r.second;
        if(!viz[node])
        {
            viz[node] = 1;
            for(pair <int, int> neighbour : graph[node])
            {
                if(dist[node] + neighbour.second < dist[neighbour.first])
                {
                    dist[neighbour.first] = dist[node] + neighbour.second;
                    pq.push({-dist[neighbour.first], neighbour.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;
    dist.resize(n + 1, INF);
    graph.resize(n + 1);

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

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