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

using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

const int NMAX = 50005;
const int INF = INT_MAX;
int N, M, tata[NMAX], dist[NMAX];
vector<pair<int, int>> adj[NMAX];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;

void dijkstra(int t){
    pq.push({0, t});
    dist[t] = 0;

    while(!pq.empty()){
        int nod = pq.top().second;
        int cost = pq.top().first;
        pq.pop();

        if(cost > dist[nod]) continue;

        for(auto& e : adj[nod])
            if(dist[nod] + e.second < dist[e.first]){
                dist[e.first] = dist[nod] + e.second;
                pq.push({dist[e.first], e.first});
            }
    }
}

int main(){
    f >> N >> M;
    for(int i = 1; i <= M; i++){
        int x, y, c;
        f >> x >> y >> c;
        adj[x].push_back({y, c});
    }

    for(int i = 1; i <= N; i++)
        dist[i] = INF;

    dijkstra(1);

    for(int i = 2; i <= N; i++){
        if(dist[i] == INF){
            dist[i]= 0;
        }
        g << dist[i] << ' ';        
    }

}