#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

const int lmax = 50000;
const int INF = 2000000000;

struct Edge {
    int u, v, weight;
};

std::vector<Edge> edges;
int dist[lmax + 1];

std::vector<int> bellman_ford(int s, int n) {
    std::fill(dist, dist + n + 1, INF);
    dist[s] = 0;

    for (int i = 1; i <= n - 1; i++) {
        for (auto edge : edges) {
            if (dist[edge.u] + edge.weight < dist[edge.v]) {
                dist[edge.v] = dist[edge.u] + edge.weight;
            }
        }
    }

    std::vector<int> result;
    for (int i = 2; i <= n; i++) {
        result.push_back(dist[i] == INF ? 0 : dist[i]);
    }
    return result;
}

int main() {
    std::ifstream fin("dijkstra.in");
    std::ofstream fout("dijkstra.out");

    int n, m;
    fin >> n >> m;

    for (int i = 0; i < m; i++) {
        int u, v, w;
        fin >> u >> v >> w;
        edges.push_back({u, v, w});
    }

    std::vector<int> shortest_paths = bellman_ford(1, n);
    for (int d : shortest_paths) {
        fout << d << ' ';
    }

    fin.close();
    fout.close();
    return 0;
}