#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using Pair=pair<ll,ll>;
const ll INF=1e18;

void dijkstra(ll s,vector<vector<Pair>> &G,vector<ll> &dist){
    priority_queue<Pair,vector<Pair>,greater<Pair>> que;
    que.push({0,s});
    while(!que.empty()){
        ll to=que.top().second,cost=que.top().first;
        if(cost<dist[to]){
            dist[to]=cost;
            for(auto&& [x,y]:G[to]){
                que.push({dist[to]+y,x});
            }
        }
        que.pop();
    }
}

int main(){
    ll N,M; cin >> N >> M;
    vector<vector<Pair>> G1(N),G2(M);
    for(int i=0;i<M;i++){
        ll u,v,t; cin >> u >> v >> t;
        u--,v--;
        G1[u].push_back({v,t});
        G2[v].push_back({u,t});
    }
    vector<ll> dist1(N,INF),dist2(N,INF),dist3(N,INF),dist4(N,INF);
    dijkstra(N-2,G1,dist1);
    dijkstra(N-2,G2,dist2);
    dijkstra(N-1,G1,dist3);
    dijkstra(N-1,G2,dist4);
    for(int i=0;i<N-2;i++){
        ll ans=min(dist2[i]+dist1[N-1]+dist3[i],dist4[i]+dist3[N-2]+dist1[i]);
        if(ans<INF){
            cout << ans << endl;
        }
        else{
            cout << -1 << endl;
        }
    }
}