// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

const int INF = 1e9;
const int NMAX = 50000;
vector<pair<int, int>> L[NMAX + 1];
priority_queue<pair<int, int>> pq;
int d[NMAX + 1], vis[NMAX + 1];
int n, m;

void dijkstra(int s) {
    for(int i = 1; i <= n; i++) {
        d[i] = INF;
    }
    d[s] = 0;
    pq.push({-d[s], s});
    while(!pq.empty()) {
        int nod = pq.top().second;
        pq.pop();
        if(vis[nod] == 1) {
            continue;
        }
        vis[nod] = 1;
        for(auto it : L[nod]) {
            int vec = it.first;
            int cost = it.second;
            if(d[vec] > d[nod] + cost) {
                d[vec] = d[nod] + cost;
                pq.push({-d[vec], vec});
            }
        }

    }
}

int main() {
	ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x, y, c;
        cin >> x >> y >> c;
        L[x].push_back({y, c});
    }
    dijkstra(1);
    for(int i = 2; i <= n; i++) {
        if(d[i] == INF) {
            d[i] = 0;
        }
        cout << d[i] << ' ';
    }
}