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

using namespace std;

#define pii pair <int, int>

string filename = "dijkstra";

#ifdef LOCAL
    ifstream fin("input.in");
    ofstream fout("output.out");
#else
    ifstream fin(filename + ".in");
    ofstream fout(filename + ".out");
#endif

const int NMAX = 5e4;
const int INF = 1e9 + 1;

vector <pii> adj[NMAX + 1];

int dist[NMAX + 1];
bool viz[NMAX + 1];

int main(){

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

    for(int i = 1; i <= m; i++){
        int a, b, c;
        fin >> a >> b >> c;
        adj[a].push_back({b, c});
    }

    priority_queue <pii, vector <pii>, greater <pii>> pq;

    for(int i = 2; i <= n; i++){
        dist[i] = INF;
    }
    pq.push({dist[1], 1});

    while(!pq.empty()){
        int node = pq.top().second;
        pq.pop();

        if(!viz[node]){
            viz[node] = true;
            for(pii vec : adj[node]){
                if(vec.second + dist[node] < dist[vec.first]){
                    dist[vec.first] = dist[node] + vec.second;
                    pq.push({dist[vec.first], vec.first});
                }
            }
        }
    }

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

    return 0;
}