#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];

bool f[N];

void dijkstra(int k, int n)
{
    vector < int > d(N, 2e9);
    priority_queue < pair < int, int >, vector < pair < int, int > >, greater < pair < int, int > > > pq;
    d[1] = 0;
    pq.push({d[1], 1});
    while(!pq.empty()) {
        auto v = pq.top();
        pq.pop();
        if(f[v.second] == true) {
            continue;
        }
        f[v.second] = true;
        for(auto x : a[v.second]) {
            if(d[x.first] > d[v.second] + x.second) {
                d[x.first] = d[v.second] + x.second;
                pq.push({d[x.first], x.first});
            }
        }
    }
    for(int i = 2; i <= n; ++i) {
        if(d[i] == 2e9) {
            fout << 0 << " ";
        }
        else {
            fout << d[i] << " ";
        }
    }
}
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;
}