#include<fstream>
#include<queue>
#include<vector>
using namespace std;

struct dijk
{
	int nod,cost;
};
int i,j,n,m,p1,p2,p3;
vector<dijk> a[50001];
queue<int>q;
vector<int> d(50001,100000);
void dijkstra(int x)
{
	int i;
	q.push(x);
	d[1]=0;
	while(!q.empty())
	{
		x=q.front();
		for(i=0;i<a[x].size();++i)
			if(d[a[x][i].nod]>d[x]+a[x][i].cost)
				d[a[x][i].nod]=d[x]+a[x][i].cost,q.push(a[x][i].nod);
			q.pop();
	}
}
int main()
{
	freopen("dijkstra.in","r",stdin);
	freopen("dijkstra.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(i=1;i<=m;i++)
	{
		scanf("%d%d%d",&p1,&p2,&p3);
		a[p1].push_back((dijk){p2,p3});
		a[p2].push_back((dijk){p1,p3});
	}
	
	dijkstra(1);
	for(i=2;i<=n;i++)
		printf("%d ",d[i]);
	return 0;
}