#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define all(a) (a).begin(),(a).end()

const ll INF = 1ll << 60;

template<typename T> bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    else return false;
}

vector<ll> dijkstra(int s, int N, vector<vector<pair<int, ll>>> &G) {
    priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> que;
    vector<ll> dist(N, INF);
    que.push({0, s});
    dist[s] = 0;
    
    while (!que.empty()) {
        ll d = que.top().first;
        int v = que.top().second;
        que.pop();
        
        if (d > dist[v]) continue;
        
        for (auto e : G[v]) {
            if (chmin(dist[e.first], dist[v] + e.second)) {
                que.push({dist[e.first], e.first});
            }
        }
    }
    
    return dist;
}

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    
    int N, M;
    cin >> N >> M;
    vector<vector<pair<int, ll>>> G(N), T(N);
    rep(i, 0, M) {
        int u, v;
        ll w;
        cin >> u >> v >> w;
        --u, --v;
        G[u].push_back({v, w});
        T[v].push_back({u, w});
    }
    
    vector<ll> go1 = dijkstra(N - 2, N, T);
    vector<ll> go2 = dijkstra(N - 1, N, T);
    vector<ll> back1 = dijkstra(N - 2, N, G);
    vector<ll> back2 = dijkstra(N - 1, N, G);

    rep(k, 0, N - 2) {
        ll ans1 = go1[k] + back1[N - 1] + back2[k];
        ll ans2 = go2[k] + back2[N - 2] + back1[k];
        
        if (min(ans1, ans2) >= INF) cout << -1 << '\n';
        else cout << min(ans1, ans2) << '\n';
    }
}