#include <iostream>
#include <set>
#include <vector>
#include <fstream>
#define nmax 50001
#define weight first
#define node second
#define inf (1<<26)
using namespace std;

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

vector < pair<int, int> > v[nmax];
set< pair<int, int> >s;

int n, m, i;
int best[nmax];

void dijkstra(){
    for(int i=2; i<=n; i++) best[i]= inf;
    s.insert(make_pair(0, 1));
    while(!s.empty()){
        int current= s.begin() -> node;
        int current_val= s.begin() -> weight;
        s.erase(s.begin());
        for(int i=0; i<v[current].size(); i++)
        if(best[v[current][i].node] > current_val+v[current][i].weight){
            best[v[current][i].node] = current_val+v[current][i].weight;
            s.insert(make_pair(best[v[current][i].node], v[current][i].node));
        }
    }
    for(int i=2; i<=n; i++)
        if(best[i]==inf) fout << "0" << " ";
        else    fout << best[i] << " ";
}

int main(){
    int x, y, w;
    fin >> n >> m;
    for(i=1; i<=m; i++){
        fin >> x >> y >> w;
        v[x].push_back(make_pair(w, y));
    }
    dijkstra();
    return 0;
}