#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

// g <- pair < v , cost > 
template < class T >
vector< T > dijkstra(vector<vector<pair<int, T>>> &graph, int s) {
    T INF = numeric_limits< T >::max();
    vector<T> dist(graph.size(), INF);
    priority_queue<pair<T,int>, vector<pair<T,int>>, greater<pair<T,int>>> q;
    q.push({dist[s] = T(0), s});
    while(!q.empty()){
        auto [uc, ui] = q.top(); q.pop();
        if(uc != dist[ui]) continue;
        for(auto [vi, vc] : graph[ui]) if(dist[vi] > uc + vc) 
            q.push({dist[vi] = uc + vc, vi});
    }
    return dist;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int N,M; cin >> N >> M;
    vector<vector<pair<int,ll>>> G(N), H(N + N);
    auto h = [](int v, int p) { return v * 2 + p; };
    rep(_,M) {
        int u,v,c; cin >> u >> v >> c; u--; v--;
        G[u].push_back({v, c});
        G[v].push_back({u, c});
        for(int p : {0, 1}) {
            H[h(u, p)].push_back({h(v, p), c});
            H[h(v, p)].push_back({h(u, p), c});
        }
        H[h(u, 0)].push_back({h(v, 1), 0});
        H[h(v, 0)].push_back({h(u, 1), 0});
    }

    auto distG = dijkstra(G, 0);
    auto distH = dijkstra(H, h(0, 0));
    rep(i,N) cout << distG[i] + min(distH[h(i, 0)], distH[h(i, 1)]) << "\n";
}