#include<cstdio>
#include<queue>
#include<vector>
using namespace std;
const int N=1<<16;
int n,m,lung[N];
bool proc[N];
vector<pair<int,int> > L[N];
priority_queue<pair<int,int> > H;
void read()
{
	freopen("dijkstra.in","r",stdin);
	freopen("dijkstra.out","w",stdout);
	scanf("%d%d",&n,&m);
	int x,y,c;
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d%d",&x,&y,&c);
		L[x].push_back(make_pair(c,y));
	}
}
void init()
{
	H.push(make_pair(0,1));	
}
void solve()
{
	while(!H.empty())
	{
		pair<int,int> nod;
		nod=H.top();
		H.pop();
		if(!proc[nod.second])
		{
			lung[nod.second]=nod.first;
			proc[nod.second]=true;
			for(vector<pair<int,int> >::iterator it=L[nod.second].begin();it!=L[nod.second].end();it++)
				if(!proc[it->second])
					H.push(make_pair(nod.first-it->first,it->second));
		}
	}
}
void afis()
{
	for(int i=2;i<=n;i++)
		printf("%d ",-lung[i]);
}
int main()
{
	read();
	init();
	solve();
	afis();
	return 0;
}