#include<fstream>
#include<vector>
using namespace std;
ifstream fi("dijkstra.in");
ofstream fo("dijkstra.out");
int n,m,a,b,c,d[50001],k;
char viz[50001];
vector <pair<int,int> > v[50001];

void dijkstra(int x){
	int min=2000000000;
	for(int i=1;i<=n;++i)
		if(d[i]<min&&viz[i]==0){
			min=d[i];
			k=i;
		}
	if(min!=2000000000){	
		viz[k]=1;
		for(int i=0;i<v[k].size();++i)
			if(d[v[k][i].first]>d[k]+v[k][i].second)
				d[v[k][i].first]=d[k]+v[k][i].second;
		dijkstra(k);
	}
}
int main() {
	fi>>n>>m;
	for(int i=1;i<=m;++i){
		fi>>a>>b>>c;
		v[a].push_back(make_pair(b,c));
	}

	for(int i=2;i<=n;++i)
		d[i]=2000000000;
	
	dijkstra(1);
	for(int i=2;i<=n;++i)
		fo<<d[i]<<' ';
	fi.close();
	fo.close();
	return 0;
}