#include<vector>
#include<fstream>
using namespace std;

#define nn 50001
#define pb push_back
#define mp make_pair
#define infinit 1<<30
vector< pair <int,int> >g[nn];
int n,m,d[nn],v[nn];

void citire(){
    int a,b,c;
    ifstream fin("dijsktra.in");
    fin>>n>>m;
    for(;m;--m){
        fin>>a>>b>>c;
        g[a].pb(mp(b,c));
    }
}
void afisare(){
    FILE *f=fopen("dijkstra.out","w");
    for(int i=2;i<=n;++i)
        fprintf(f,"%d ",d[i]!=infinit?d[i]:0);
}
void bellmann(int sursa){
    for(int i=1;i<=n;++i)
        d[i]=infinit;
    d[sursa]=0;
    v[sursa]=1;
    int coada[nn],st,dr,i;
    st=dr=1;
    coada[1]=sursa;
    while(st<=dr){
        int k=coada[st++];
        //v[k]=0;//esential
        //if(d[k]<infinit)
        for(i=0;i<g[k].size();++i){
            int kk=g[k][i].first;
            int cost=g[k][i].second;
            if(d[k]+cost<d[kk]){
                d[kk]=d[k]+cost;
                //if(!v[kk]){
                    v[kk]=1;
                    coada[++dr]=kk;
                //}
            }
            else
                if(!v[kk]){
                    v[kk]=1;
                    coada[++dr]=kk;
                }
        }
    }
}

int main(){
    citire();
    bellmann(1);
    afisare();
    return 0;
}