#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <climits>

using namespace std;

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

const int NMAX = 50003;

int n, m;
int dist[NMAX];
bool seen[NMAX];
vector<vector<pair<int, int>>> g(NMAX);
priority_queue<pair<int, int>> pq;

void dijkstra(int src) {
    for (int i = 1; i <= n; i++) {
        dist[i] = INT_MAX;
    }
    dist[src] = 0;
    pq.push({0, src});
    while (!pq.empty()) {
        int node = pq.top().second;
        pq.pop();
        if (seen[node]) { continue; }
        seen[node] = true;
        for (auto [son, cost] : g[node]) {
            if (dist[node] + cost < dist[son]) {
                dist[son] = dist[node] + cost;
                pq.push({-dist[son], son});
            }
        }
    }
}

int main() {

    in >> n >> m;

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

    dijkstra(1);

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

    return 0;
}