#include <fstream>
#include <vector>
#define dmax 2000000000
#include <set>
#include <utility>
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,nr;
pair <int , int > p;
set< pair <int, int> > S;
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;
    S.insert(make_pair(0, 1));
    while(nr<=n){
      if(S.empty())
        break;
        p = *S.begin();
        S.erase(S.begin());
        v[p.second]=1;
        nr++;
            for(it=L[p.second].begin();it!=L[p.second].end();it++){
                if( d[it->first]>d[p.second]+it->second ){
                    S.erase(make_pair(d[it->first],it->first));
                    d[it->first]=d[p.second]+it->second;
                    S.insert(make_pair(d[it->first],it->first));
                }
            }
    }
    for(i=2;i<=n;i++){
        if(d[i]!=dmax)
            fout<<d[i]<<' ';
        else
            fout<<'0'<<' ';
    }
    return 0;
}