#include <bits/stdc++.h> //JuniorMonster a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
using namespace std;
ll n,m,d[50005],x,y,z;
multiset<pair<ll,ll> >q;
vector<pair<ll,ll> >v[50005];
std::multiset< pair<ll,ll> >::iterator it;
std::multiset< pair<ll,ll> >::iterator it1;
int32_t main(){
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
CODE_START;
cin>>n>>m;
for(ll i=0;i<m;i++)
{
cin>>x>>y>>z;
v[x].pb(mp(y,z));
}
for(ll i=2;i<=n;i++)
d[i]=1000000000000000000;
q.insert(mp(0,1));
while(q.empty()==false){
        it=q.begin();
        x=it->second;
        y=it->first;
        q.erase(q.begin());
        for(ll i=0;i<v[x].size();i++){
            if(d[x]+v[x][i].s<d[v[x][i].f]){
                if(d[v[x][i].f]!=1000000000000000000) q.erase(q.find(mp(d[v[x][i].f],v[x][i].f)));
                d[v[x][i].f]=d[x]+v[x][i].s;
                q.insert(mp(d[v[x][i].f],v[x][i].f));
            }
        }
    }
    for(ll i=2;i<=n;i++){
        if(d[i]!=1000000000000000000)cout<<d[i]<<' ';
        else cout<<'0'<<' ';
    }
}