#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define INF 999999999
#define fs first
#define sc second
 
set <pair<int,int>> C;
int n,m,D[100000],x,y,z;
vector<pair<int,int>>A[100003];
	
int main()
{
	ifstream cin("dijkstra.in");
	ofstream cout("dijkstra.out");
	cin>>n>>m;
	for(int i=0;i<m;i++)
	  {
	  	cin>>x>>y>>z;
	  	A[x].pb({y,z});
	  }
	  for(int i=1;i<=n;i++)
	  {
	  	D[i]=INF;
	  }
	  D[1]=0;
	C.insert({0,1}); 
	while(!C.empty())
	{ 
		int n=C.begin()->second;
		C.erase(C.begin());
		for(vector<pair<int,int>>::iterator i=A[n].begin();i!=A[n].end();i++)
		{
			x=i->fs;
			z=i->sc;
		     if(D[x]>D[n]+z){	
		        if(D[x]!=INF)C.erase(C.find({D[x],x}));
				 D[x]=D[n]+z;
				 C.insert({D[x],x});	 
			 }
		 }	     
	}
	for(int i=2;i<=n;i++) cout<<(D[i]==INF ? 0:D[i])<<" ";
 
}