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

typedef pair<int64_t, int64_t> P;

vector<P> edges[200000];

int main(){
    int N, M;
    cin >> N >> M;
    for(int i=0; i<M; i++){
        int a, b, c;
        scanf("%d %d %d", &a, &b, &c);
        a--; b--;
        edges[a].push_back({b, c});
        edges[b].push_back({a, c});
        edges[a+N].push_back({b+N, c});
        edges[b+N].push_back({a+N, c});
        edges[a].push_back({b+N, 0});
        edges[b].push_back({a+N, 0});
    }

    int64_t dist[200000];
    for(int i=0; i<2*N; i++) dist[i] = 1e18;
    dist[0] = dist[N] = 0;
    priority_queue<P, vector<P>, greater<P>> que;
    que.push({0, 0});
    while(que.size()){
        auto p = que.top(); que.pop();
        int64_t d = p.first;
        int i = p.second;
        if(d > dist[i]) continue;
        for(auto& e : edges[i]){
            int j = e.first;
            int64_t d2 = d + e.second;
            if(d2 < dist[j]){
                dist[j] = d2;
                que.push({d2, j});
            }
        }
    }

    for(int i=0; i<N; i++){
        int64_t ans = dist[i] + dist[i+N];
        printf("%lld\n", ans);
    }
    return 0;
}