#include<iostream>
#include<cstring>
#include<queue>
#include<cmath>
#define L_MAX (long long)1e15
using namespace std;
struct node{long long v,w;};
long long n,m,s,ans,u,v,w,d[1100010],vis[1100010],t;
vector<node> a[1100010];
priority_queue<pair<long long,long long> > q;
signed main(){
	for(int i=0;i<=1090010;i++)d[i]=L_MAX;
	scanf("%d%d",&n,&m);
	for(long long i=1;i<=m;i++){
		scanf("%d%d%d",&u,&v,&w);
		a[u].push_back(node{v,w});
	}
	d[1]=0;
	q.push(make_pair(0,1));
	while(!q.empty()){
		t=q.top().second;
		q.pop();
		if(vis[t])continue;
		vis[t]=1;
		for(long long i=0;i<a[t].size();i++){
			long long v=a[t][i].v,w=a[t][i].w;
			if(d[t]+w<d[v]){
				d[v]=w+d[t];
				q.push(make_pair(-d[v],v));
			}
		} 
	}
	for(long long i=1;i<=n;i++)
		if(d[i]==L_MAX)printf("-1 ");
		else printf("%d ",d[i]);
}