#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <deque>

using namespace std;

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

#define nmax 50005
#define ll long long
#define inf (1<<30)

int n, m, dist[nmax];
vector< pair<int,int> > gf[nmax];
set< pair<int,int> > S;

void citeste(){
    f >> n >> m;
    int x, y, z;
    for(int i=1; i<=m; ++i){
        f >> x >> y >> z;
        gf[x].push_back( make_pair(y,z) );
    }
}

void rezolva(){
    S.insert( make_pair(0, 1) );
    for(int i=2; i<=n; ++i) dist[i] = inf;
    for(; S.size(); ){
        int nod = (*S.begin()).second;
        int Min = (*S.begin()).first;
        S.erase(S.begin());

        for(int i=0; i<gf[nod].size(); ++i){
            int vc = gf[nod][i].first;
            int cost = gf[nod][i].second;
            if (dist[vc] > Min + cost ){
                dist[vc] = Min + cost;
                S.insert( make_pair(dist[vc], vc) );
            }
        }
    }
    for(int i=2; i<=n; ++i){
        if (dist[i] == inf) g << 0 << " ";
        else g << dist[i] << " ";
    }

}

int main(){
    citeste();
    rezolva();

    f.close();
    g.close();

    return 0;
}