#include<bits/stdc++.h>
#define pb push_back
using namespace std;
const int N=100020, INF=1e9;
set <pair<int,int> > q;
vector <pair<int,int> > lda[N];
int dp[N];
int main(){
	ifstream f("dijkstra.in");
	ofstream g("dijkstra.out");
	int n, m;
	f>>n>>m;
	while(m--){
		int x,y,z;
		f>>x>>y>>z;
		lda[x].pb({y,z});
	}
	q.insert({0,1});
	for(int i=2;i<=n;i++)dp[i]=INF;
	while(!q.empty()){
		int nod=q.begin()->second;
		q.erase(q.begin()); m=lda[nod].size();
		for(int i=0;i<m;i++)if(dp[nod]+lda[nod][i].second<dp[lda[nod][i].first]){
			int x=lda[nod][i].first, y=lda[nod][i].second;
			if(dp[x]!=INF){
				q.erase(q.find({dp[x], x}));
			}
			dp[x]=dp[nod]+y;
			q.insert({dp[x], x});
		}
	}
	for(int i=2;i<=n;i++)if(dp[i]!=INF)g<<dp[i]<<' ';else g<<"0 ";
}