#include <fstream>
#include <set>
#include <queue>
#include <climits>

#define NMAX 50000

using namespace std;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

int viz[NMAX + 1];
int dist[NMAX + 1];
vector<pair<int, int>> g[NMAX + 1];
int n, m;

int main() {
    cin >> n >> m;
    for (int a, b, c, i = 1; i <= m; ++i) {
        cin >> a >> b >> c;
        g[a].push_back({b, c});
    }
    fill(dist + 2, dist + 1 + n, INT_MAX);
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
    q.push({ 0, 1 });
    while (!q.empty()) {
        int nod = q.top().second;
        q.pop();
        if (viz[nod]) continue;
        viz[nod] = 1;
        for (auto i : g[nod]) {
            int cost = i.second;
            int muchie = i.first;
            if (dist[muchie] > dist[nod] + cost) {
                dist[muchie] = dist[nod] + cost;
                q.push({ dist[muchie], muchie });
            }
        }
    }

    for (int i = 2; i <= n; ++i) {
        if (dist[i] != INT_MAX) cout << dist[i] << ' ';
        else cout << 0 << ' ';
    }
    return 0;
}