#include <fstream>
#include <vector>
#include <set>
#define INFINIT 250000*20000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,x,y,cost,d[250010],p;
vector< pair<int,int > >v[250010];
set<pair<int,int> >sett;

int main(){
    fin>>n>>m;
    for(int i=1;i<=m;i++){
        fin>>x>>y>>cost;
        v[x].push_back(make_pair(y,cost));
    }
    for(int i=2;i<=n;i++){
        d[i]=INFINIT;
    }
    sett.insert(make_pair(0,1));
    while(!sett.empty()){
        p=sett.begin()->second;
        sett.erase(sett.begin());
        for(int i=0;i<v[p].size();i++){
            if(v[p][i].second+d[p]<d[v[p][i].first]){
                sett.erase({d[v[p][i].first],v[p][i].first});
                d[v[p][i].first]=v[p][i].second+d[p];
                sett.insert({d[v[p][i].first],v[p][i].first});
            }

        }

    }
    for(int i=2;i<=n;i++){
        if(d[i] != INFINIT){
            fout<<d[i]<<" ";
        }
        else{
            fout<<"0 ";
        }
    }





}