#include <fstream>
#include <iostream>
#include <climits>
#define NMAX 50001
#define infinit INT_MAX
#include <queue>

using namespace std;

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

int n,m,dist[NMAX];
bool folosit[NMAX];

struct comparare{
    bool operator()(int x,int y){
        return dist[x]>dist[y];
    }
};

priority_queue<int,vector<int>,comparare>coada;

typedef struct nod{
    int nr;
    int cost;
    nod *urm;
}*pnod;

pnod a[NMAX],p;

void add(pnod &dest,int y,int c){
    p=new nod;
    p->nr=y;
    p->cost=c;
    p->urm=dest;
    dest=p;
    //cout<<p->nr<<'\n';
}

void citire(){
    in>>n>>m;
    int x,y,c;
    for(int i=1;i<=m;i++){
        in>>x>>y>>c;
        add(a[x],y,c);
    }
}

void dijkstra(int start){
    for(int i=1;i<=n;i++)
        dist[i]=infinit;
    dist[start]=0;
    coada.push(start);
    folosit[start]=true;
    while(!coada.empty()){
        int nodul=coada.top();
        coada.pop();
        folosit[nodul]=false;
        for(p=a[nodul];p!=NULL;p=p->urm){
            int vecin=p->nr;
            int cost=p->cost;
            if(dist[nodul]+cost<dist[vecin]){
                dist[vecin]=dist[nodul]+cost;
                if(folosit[vecin]==false){
                    coada.push(vecin);
                    folosit[vecin]=true;
                }
            }
        }
    }
}

int main(){
    citire();
    dijkstra(1);
    for(int i=2;i<=n;i++){
        if(dist[i]!=infinit)
            out<<dist[i]<<" ";
        else
            out<<"0 ";
    }
    return 0;
}