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

using namespace std;


const int INF = 2000000000; 

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

void Dijkstra(int startNode, int N, vector<vector<pair<int, int>>>& adj) {
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    vector<int> dist(N + 1, INF);

    dist[startNode] = 0;
    pq.push({0, startNode});

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

        if (d > dist[u]) 
            continue;

        for (auto &edge : adj[u]) {
            int v = edge.first;
            int weight = edge.second;

            if (dist[u] + weight < dist[v]) {
                dist[v] = dist[u] + weight;
                pq.push({dist[v], v});
            }
        }
    }

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

int main() {
    int N, M;
    fin >> N >> M;

    vector<vector<pair<int, int>>> adj(N + 1);

    for (int i = 0; i < M; i++) {
        int u, v, c;
        fin >> u >> v >> c;
        adj[u].push_back({v, c}); 
    }

    // Calculăm de la nodul 1
    Dijkstra(1, N, adj);
    
    return 0;
}