#include <bits/stdc++.h>

using namespace std;

const int NMAX = 1e5;
vector<pair<int, int>> G[NMAX + 1];
int d[NMAX + 1], vis[NMAX + 1];
priority_queue<pair<int, int>> pq;
int n, m;


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

int main() {
	ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
    cin >> n >> m;
    while(m--) {
        int a, b, c;
        cin >> a >> b >> c;
        G[a].push_back({b, c});
    }
    dijkstra(1);
    for(int i = 2; i <= n; i++) {
        if(d[i] == 1e9) {
            d[i] = 0;
        }
        cout << d[i] << ' ';
    }
}