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

using namespace std;

const int Nmax = 50005;

int n, m;

vector<int> dist(Nmax, INT_MAX);
vector<pair<int, int>> L[Nmax];    // first = nod && second = val muchie
priority_queue<pair<int, int>> Q;  // first = -dist nod && second = nod

void Dijkstra(){
    dist[1] = 0;
    Q.push({0, 1});
    while(!Q.empty()){
        int nod = Q.top().second, dist_nod = -Q.top().first;
        Q.pop();

        if(dist_nod > dist[nod]){
            continue;
        }

        for(pair<int, int> x : L[nod]){
            int vec = x.first;
            int val_vec = x.second;
            if(dist[vec] > dist_nod + val_vec){
                dist[vec] = dist_nod + val_vec;
                Q.push({-dist[vec], vec});
            }
        }
    }
}

int main()
{
    ifstream fin("dijkstra.in");
    ofstream fout("dijkstra.out");
    fin >> n >> m;
    while(m--){
        int x, y, val;
        fin >> x >> y >> val;
        L[x].push_back({y, val});
    }
    Dijkstra();
    for(int i = 2; i <= n; i++){
        if(dist[i] < INT_MAX){
            fout << dist[i] << ' ';
        }
        else{
            fout << 0 << ' ';
        }
    }

    return 0;
}