#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll =  long long ;
using P = pair<ll,ll> ;
using tp = tuple<ll,ll,ll>;
const int INF = 1e9;
const int MOD = 1000000007;
int n = 100005,m = 200005;
vector<vector<P>> graph(n,vector<P>());

vector<ll> dijkstra(ll start){
    vector<ll> shortest(n);
    vector<bool> visited(n,false);
    priority_queue<pair<ll,ll>,vector<pair<ll ,ll>>,greater<pair<ll,ll>>> pq;
    pq.push(make_pair(0,start));
    while (!pq.empty()){
        pair<ll,ll> now = pq.top();
        pq.pop();
        ll cost,node;
        tie(cost,node) = now;
        if(visited[node]){
            continue;
        }else{
            shortest[node] = cost;
            visited[node] = true;
            for(pair<ll,ll> next:graph[node]){
                ll next_cost,next_node;
                tie(next_cost,next_node) = next;
                pq.push(make_pair(cost+next_cost,next_node));
            }
        }
    }
    return shortest;
}

vector<ll> dijkstra2(int start){
    vector<ll> res(n,0);
    vector<bool> seen(n,false);
    priority_queue<tp,vector<tp>,greater<tp>> pq;
    pq.push(tp(0,0,0));
    while(!pq.empty()){
        ll d = get<0>(pq.top()) + get<1>(pq.top());
        ll mx = get<1>(pq.top());
        ll node = get<2>(pq.top());
        pq.pop();
        if(seen[node]) continue;
        else{
            res[node] = d - mx;
            seen[node] = true;
            for(P next:graph[node]){
                ll next_cost,next_node ;
                tie(next_cost,next_node) = next;
                ll d_ = d + next_cost;
                ll mx_ = max(mx,next_cost);
                pq.push(tp(d_-mx_,mx_,next_node));
            }
        }
    }
    return res;
}

int main(){
    cin >> n >> m;
    rep(i,m){
        ll a,b,c;
        cin >> a >> b >> c;
        --a;--b;
        graph[a].push_back(P(c,b));
        graph[b].push_back(P(c,a));
    }
    vector<ll> dis1 = dijkstra(0);
    vector<ll> dis2 = dijkstra2(0);
    rep(i,n){
        cout << dis1[i] + dis2[i] << '\n';
    }
    return 0;
}