#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

const int MAXN = 50005;
const int INF = 1e9 + 5;

vector<pair<int, int>> g[MAXN];
int dist[MAXN];
int n, m;

void calcDist(int start) {
    for (int i = 1; i <= n; ++i)
        dist[i] = INF;
    dist[start] = 0;
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> coada;
    coada.push({0, start});
    while(!coada.empty()) {
        auto[distCurenta, nod] = coada.top();
        coada.pop();
        if (distCurenta > dist[nod]) continue;
        for (auto& muchie : g[nod]) {
            int vecin = muchie.first;
            int cost = muchie.second;
            if (dist[vecin] > dist[nod] + cost) {
                dist[vecin] = dist[nod] + cost;
                coada.push({dist[vecin], vecin});
            }
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);

    cin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int x, y, c;
        cin >> x >> y >> c;
        g[x].push_back({y, c});
    }

    calcDist(1);

    for (int i = 2; i <= n; ++i) {
        if (dist[i] == INF) cout << 0 << " ";
        else cout << dist[i] << " ";
    }

    return 0;
}