#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

struct D{
	ll d;
	int num,idx;
	bool operator<(const D& x)const{
		return d > x.d;
	}
};
using G = vector<vector<pair<ll,int>>>;
int main(){
	int n,m;
	cin>>n>>m;
	G v(n);
	rep(i,m){
		int a,b,c;
		cin>>a>>b>>c;
		--a;--b;
		v[a].emplace_back(c,b);
		v[b].emplace_back(c,a);
	}
	priority_queue<D> que;
	vector<vector<ll>> dist(2,vector<ll>(n,longinf));
	dist[0][0]=dist[1][0]=0;
	que.emplace(D{0,0,0});
	que.emplace(D{0,1,0});
	while(que.size()){
		D p=que.top();que.pop();
		ll d=p.d;
		int cur=p.idx, num=p.num;
		if(d>dist[num][cur])continue;
		for(auto e : v[cur]){
			if(dist[num][e.second]>d+e.first){
				dist[num][e.second]=d+e.first;
				que.emplace(D{dist[num][e.second],num,e.second});
			}
			if(num==0&&dist[1][e.second]>d){
				dist[1][e.second]=d;
				que.emplace(D{dist[1][e.second],1,e.second});
			}
		}
	}
	rep(i,n){
		cout<<dist[0][i]+dist[1][i]<<endl;
	}
	return 0;
}