#include <bits/stdc++.h>
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n,m,x,y,z,s, v[100000];
vector<pair<int,int>> a[100000];
const int r=0x3f3f3f3f;// alternativa la INT_MAX in baza 16 
void dijkstra()
{
    priority_queue <pair<int,int>> q;
    q.push({0,s});// in loc de make_pair merge si { }
    while(!q.empty())
    {
       x=q.top().first;
       y=q.top().second;
       q.pop();
       if(x>v[y]) continue;
       for(auto b:a[y])
       {
           int f=b.first;
           int s=b.second;
           if(v[f]>v[y] + s)
           {
               v[f]=v[y]+s;
               q.push({-v[f],f});
           }
       }
    }
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;++i){
        fin>>x>>y>>z;
        a[x].push_back({y,z});
    }
    memset(v,r,sizeof(v));
    s=1;
    v[s] = 0;
    dijkstra();
    for(int i=2;i<=n;i++)
        if(v[i]!=r) fout<<v[i]<<" "; else fout<<0<<" ";
}