#include <bits/stdc++.h>

using namespace std;

ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");

void usain_bolt()
{
    ios::sync_with_stdio(false);
    fin.tie(0);
}

const int N = 5e4 + 5;

vector < pair < int, int > > a[N];

priority_queue < pair < int, int >, vector < pair < int, int > >, greater < pair < int , int > > > pq;

void dijkstra(int k, int n)
{
    vector < bool > in(N, false);
    vector < int > d(N, 2e9);
    d[1] = 0;
    pq.push({d[1], 1});
    while(!pq.empty()) {
        int node = pq.top().second;
        int len = pq.top().first;
        pq.pop();
        in[node] = false;
        for(auto v : a[node]) {
            if(d[v.first] > d[node] + v.second) {
                d[v.first] = d[node] + v.second;
                if(in[v.first] == false) {
                    pq.push({d[v.first], v.first});
                }
            }
        }
    }
    for(int i = 2; i <= n; ++i) fout << (d[i] != 2e9 ? d[i] : 0) << " ";
}

int main()
{
    usain_bolt();

    int n, m;

    fin >> n >> m;
    for(int i = 1; i <= m; ++i) {
        int x, y, w;

        fin >> x >> y >> w;
        a[x].push_back({y, w});
    }
    dijkstra(1, n);
    return 0;
}