#include<fstream>
#define inf 200000000
#include<queue>
#include<vector>
#define dim 50002
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
queue<int>Q;
vector<pair < int ,int > >G[dim];
int i,n,m,a,b,c,D[dim];
void dijkstra (){
	for(i=2;i<=n;i++)
		D[i]=inf;
	D[1]=0;
	int x;
	Q.push(1);
	while(!Q.empty()){
		x=Q.front();
		Q.pop();
		for(int i=0;i<G[x].size();++i)
			if(D[G[x][i].first]>D[x]+G[x][i].second){
				D[G[x][i].first]=D[x]+G[x][i].second;
				Q.push(G[x][i].first);
			}
		
		
	}
}
int main (){
	f>>n>>m;
	for(i=1;i<=m;i++){
		f>>a>>b>>c;
		G[a].push_back(make_pair(b,c));
	}
	dijkstra();
	for(i=2;i<=n;i++){
		if(D[i]!=inf)
			g<<D[i]<<" ";
		else
			g<<"0 ";
	}
		return 0;
}