#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
#define N 50001
#define I (1<<30)
int n,m,d[N],i,x,y,c,k;
vector<int> u[N],v[N];
bool w[N];
queue<int> q;
int main()
{
	f>>n>>m;
	for(i=1;i<=m;i++)
		f>>x>>y>>c,u[x].push_back(y),v[x].push_back(c);
	for(i=2;i<=n;i++)
		d[i]=I;
	for(q.push(1);!q.empty();)
	{
		x=q.top(),q.pop();
		if(!w[x])
			for(w[x]=1,k=u[x].size(),i=0;i<k;i++)
				if(d[u[x][i]]>d[x]+v[x][i])
					d[u[x][i]]=d[x]+v[x][i],q.push(u[x][i]);
	}
	for(i=2;i<=n;i++)
		g<<(d[i]==I?0:d[i])<<' ';
}