#include<bits/stdc++.h>

#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pii pair<int,int>
#define pill pair<int,ll>
#define pll pair<ll,ll>
#define pb push_back
#define fi first
#define se second
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
#define MASK(x) (((1)<<(x))-1)
#define getbit(x,k) (((x)>>(k))&1)

using namespace std;

const int maxn=1e5+50,mod=1e9+7;
const ll inf=0x3f3f3f3f3f3f3f3f;
int n,m;
vector<pll>eg[maxn],teg[maxn];
ll d1[maxn],d2[maxn];

void dijkstra(vector<pll>e[], ll d[], int st)
{
    memset(d,0x3f,(n+10)*sizeof(ll));
    priority_queue<pll,vector<pll>,greater<pll>>pQ;
    if(st!=-1)
    {
        d[st]=0;
        pQ.push({d[st],st});
    }
    else
    {
        for(int i=1;i<=n;i++) if(d1[i]!=inf)
        {
            d[i]=d1[i];
            pQ.push({d1[i],i});
        }
    }
    while(pQ.size())
    {
        pll u=pQ.top();pQ.pop();
        if(u.fi!=d[u.se]) continue;
        for(pll v:e[u.se]) if(u.fi+v.se<d[v.fi])
        {
            d[v.fi]=u.fi+v.se;
            pQ.push({d[v.fi],v.fi});
        }
    }
}
int main()
{
    fastio
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int u,v,c;cin>>u>>v>>c;
        eg[u].pb({v,c});
        teg[v].pb({u,c});
    }
    dijkstra(eg,d1,1);
    dijkstra(teg,d2,-1);
    for(int i=2;i<=n;i++)
        cout<<(d2[i]==inf?-1:d2[i])<<' ';
}
/*
7 6
1 2 1
1 3 1
2 4 1
3 4 1
4 5 1
6 7 1
*/