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

int main() {
    std::ifstream input("dijkstra.in");
    std::ofstream output("dijkstra.out");

    int n, m;
    input >> n >> m;

    std::vector<std::vector<std::pair<int, int>>> graph(n + 1);

    for (int i = 0; i < m; ++i) {
        int a, b, c;
        input >> a >> b >> c;
        graph[a].emplace_back(b, c);
    }

    std::vector<int> dist(n + 1, INT_MAX);
    dist[1] = 0;

    auto cmp = [](const std::pair<int, int> &lhs, const std::pair<int, int> &rhs) {
        return lhs.second > rhs.second;
    };
    std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int>>, decltype(cmp)> pq(cmp);
    pq.emplace(1, 0);

    while (!pq.empty()) {
        int u = pq.top().first;
        int d = pq.top().second;
        pq.pop();

        if (d != dist[u]) continue;

        for (const auto &edge : graph[u]) {
            int v = edge.first;
            int weight = edge.second;
            if (dist[u] + weight < dist[v]) {
                dist[v] = dist[u] + weight;
                pq.emplace(v, dist[v]);
            }
        }
    }

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

    input.close();
    output.close();
    return 0;
}