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

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

const int NMAX = 50000;
vector<pair<int, int>> L[NMAX + 1];
int d[NMAX + 1], vis[NMAX + 1];
set<pair<int, int>> s; //(distanta fata de sursa, nod)

int main() {
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
	int n, m;
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x, y, c;
        cin >> x >> y >> c;
        L[x].push_back({y, c});
    }
    for(int i = 1; i <= n; i++) {
        d[i] = 1e9;
    }
    d[1] = 0;
    s.insert({d[1], 1});
    while(!s.empty()) {
        auto it = s.begin();
        s.erase(it);
        int nod = (*it).second;
        if(vis[nod]) {
            continue;
        }
        vis[nod] = 1;
        for(auto next : L[nod]) {
            int vecin = next.first;
            int cost = next.second;
            if(d[vecin] > d[nod] + cost) {
                d[vecin] = d[nod] + cost;
                s.insert({d[vecin], vecin});
            }
        }
    }
    for(int i = 2; i <= n; i++) {
        if(d[i] == 1e9) {
            d[i] = 0;
        }
        cout << d[i] << ' ';
    }
}