#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;
int d[N];
bool f[N];

void dijkstra(int n)
{
    for(int i = 1; i <= n; ++i) d[i] = 2e9;
    d[1] = 0;
    pq.push({d[1], 1});
    while(!pq.empty()) {
        int v = pq.top().second;
        pq.pop();
        if(f[v] == true) continue;
        f[v] ^= 1;
        for(auto x : a[v]) {
            int to = x.first;
            int cost = x.second;
            if(d[to] > d[v] + cost) {
                d[to] = d[v] + cost;
                pq.push({d[to], to});
            }
        }
    }
    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(n);
    return 0;
}