//sunt suparata pe baiatul ala destept care ma ajuta :P
#include<stdio.h>
#include<queue>
#include<vector>
using namespace std;

const int N=50715;
const int INF=1000000000;

struct succesor 
{
	int vf,cost;
};

vector<succesor> a[N];
priority_queue<pair<int,int> > h;
int n,d[N];
bool s[N];

void eu_ma_chinui_sa_citesc()
{
	int m,i,x,y,c;
	scanf("%d%d",&n,&m);
	for(i=1;i<=m;i++)
	{
		scanf("%d%d%d",&x,&y,&c);
		a[x].push_back((succesor){y,c});
	}
}

int vf_cost_minim()
{

	while(!h.empty())
	{
		if(!s[h.top().second])
			return h.top().second;
		h.pop();
	}
	return 0;
}

void eu_actualizez(int x)
{
	int y,c;
	for(size_t i=0;i<a[x].size();i++)
	{
		y=a[x][i].vf;
		c=a[x][i].cost;
		if(d[x] + c < d[y])
		{
			d[y] = d[x] + c;
			h.push(make_pair(-d[y],y));
		}
	}
}
void init()
{
	int i;
	for(i=0;i<=n;i++)
		d[i] = INF;
}
void eu_il_implementez_pe_djikistra_asta(int x0)
{
	int x;
	d[x0]=0;
	h.push(make_pair(d[x0],x0));
	for(int i=1;i<n;i++)
	{
		x = vf_cost_minim();
		if(d[x] == INF)
			return ;
		s[x] = true;
		eu_actualizez(x);
	}
}
	
void eu_afisez_cu_multe_dificultati()
{
	int i;
	for(i=2;i<=n;i++)
		if(d[i] == INF)
			printf("0 ");
		else
			printf("%d ", d[i]);
}

int main()
{
	freopen("dijkstra.in","r",stdin);
	freopen("dijkstra.out","w",stdout);
	
	eu_ma_chinui_sa_citesc();
	init();
	eu_il_implementez_pe_djikistra_asta(1);
	eu_afisez_cu_multe_dificultati();
	
	return 0;
}