#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[100000];
bool V[1000000];
	
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 b=C.begin()->second;
		C.erase(C.begin());
		for(int it=0;it<= A[b].size();it++)
		{
		     if(D[b]+A[b][it].sc<D[A[b][it].fs]){	
		        if(D[A[b][it].sc]!=INF) C.erase(C.find({D[A[b][it].fs],A[b][it].fs}));
				 D[A[b][it].fs]=D[b]+A[b][it].sc;
				 C.insert({D[A[b][it].fs],A[b][it].fs});
			 }
		 }
		 
		     
	}
	for(int i=2;i<=n;i++) cout<<(D[i]==INF ? 0:D[i])<<" ";

}