#include <fstream>
#include <vector>
#define dmax 2000000000
using namespace std;
vector < pair<int, int> > L[50100];
vector < pair<int, int> > ::iterator it;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,a,b,c,i,j,v[100100],d[100100],ok,poz,vmin;
pair <int , int > p;

int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>a>>b>>c;
        L[a].push_back(make_pair(b,c));
    }
    for(i=1;i<=n;i++){
        d[i]=dmax;
    }
    d[1]=0;
    while(!ok){
        vmin=dmax;
        for(i=1;i<=n;i++){
            if(d[i]<vmin&&v[i]==0){
                vmin=d[i];
                poz=i;
            }
        }
        if(vmin==dmax)
            break;
        else{
            v[poz]=1;
            for(it=L[poz].begin();it!=L[poz].end();it++){
                if( d[it->first]>d[poz]+it->second ){
                    d[it->first]=d[poz]+it->second;
                }
            }
        }
    }
    for(i=2;i<=n;i++){
        if(d[i]!=dmax)
            fout<<d[i]<<' ';
        else
            fout<<'0'<<' ';
    }
    return 0;
}