#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#define INF INT_MAX
using namespace std;
ifstream fin("djikstra.in");
ofstream fout("djikstra.out");
int n,m,x,y,i,cost,d[50001],costac,x1,x2;
vector< pair<int,int> > G[50001];
set< pair<int,int> > H;
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
        d[i]=INF;
    H.insert(make_pair(0,1));
    d[1]=0;
    for(int i=1;i<=m;i++){
        fin>>x>>y>>cost;
        G[x].push_back(make_pair(y,cost));
    }
    while(!H.empty()){
        x1=H.begin()->second;
        H.erase(H.begin());
        for(vector< pair<int,int> >::iterator it = G[x1].begin(); it!=G[x1].end(); it++){
            x2=it->first;
            costac=it->second;
            if(d[x2]>d[x1]+costac){
                if(d[x2]!=INF)
                    H.erase(H.find(make_pair(d[x2],x2)));
                d[x2]=d[x1]+costac;
                H.insert(make_pair(d[x2],x2));
            }
        }
    }
    for(int i=2;i<=n;i++)
        fout<<d[i]<<' ';
    return 0;
}