#include <cstdio>
#include <queue>
#include <vector>
#define INF 2000000000
#define DIM 50001
using namespace std;
int n,m,i,a,b,c,x,y,vecin,sol[DIM];
priority_queue < pair<int,int>, vector< pair<int,int> >, greater<pair<int,int> > > H;
vector < pair<int,int> > v[DIM];
int main (){
    //ifstream fin ("dijkstra.in");
    //ofstream fout ("dijkstra.out");
    FILE *fin = fopen ("dijkstra","r");
    FILE *fout = fopen ("dijkstra","w");
    //fin>>n>>m;
    fscanf (fin,"%d%d",&n,&m);
    for (i=1;i<=m;i++){
        //fin>>a>>b>>c;
        fscanf (fin,"%d%d%d",&a,&b,&c);
        v[a].push_back (make_pair(b,c));
    }
    for (i=2;i<=n;i++)
        sol[i] = INF;
    H.push(make_pair(0,1));
    while (!H.empty()){
        x = H.top().second;
        y = H.top().first;
        H.pop();
        for (vector< pair < int,int > >:: iterator it = v[x].begin();it!=v[x].end();it++){
            vecin = it->first;
            c = it->second;
            if (sol[x] + c < sol[vecin]){
                sol[vecin] = sol[x] + c;
                H.push(make_pair(sol[vecin],vecin));
            }
        }
    }
    for (i=2;i<=n;i++){
        if (sol[i] != INF)
            fprintf (fout,"%d ",sol[i]);
            //fout<<sol[i]<<" ";
        else
            fprintf (fout,"0 ");
            //fout<<0<<" ";
    }

    return 0;
}