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


int main(){
	
	int N,M;
	cin>>N>>M;
	
	vector<vector<pair<int,long long>>> E(N,vector<pair<int,long long>>());
	
	rep(i,M){
		int a,b,c;
		scanf("%d %d %d",&a,&b,&c);
		a--;b--;
		
		E[a].emplace_back(b,c);
		E[b].emplace_back(a,c);
	}
	
	vector<long long> dis(2*N,Inf);
	dis[0] = 0LL;
	dis[1] = 0LL;
	priority_queue<pair<long long,int>,vector<pair<long long,int>>,greater<pair<long long,int>>> Q;
	Q.emplace(0,0);
	
	while(Q.size()>0){
		long long D = Q.top().first;
		int u = Q.top().second/2;
		int d = Q.top().second%2;
		
		Q.pop();
		
		if(dis[u*2+d]!=D)continue;
		
		rep(i,E[u].size()){
			long long D2 = E[u][i].second;
			int v = E[u][i].first;
			if(dis[v*2+d]>D+D2){
				dis[v*2+d] = D+D2;
				Q.emplace(dis[v*2+d],v*2+d);
			}
			if(d==0){
				if(dis[v*2+1]>D){
					dis[v*2+1] = D;
					Q.emplace(dis[v*2+1],v*2+1);
				}
			}
		}
	}
	
	rep(i,N){
		cout<<dis[i*2]+dis[i*2+1]<<endl;
	}
	
    return 0;
}