#include <fstream>
#include <iostream>
#include <vector>
#include <queue>
#include <limits.h>
#include <set>
//#include <algorithm>
using namespace std;
vector<bool> visited;
vector<vector<int> > adj;
vector<vector<int> > cost;
vector<int> path;
vector<pair<int,int> > Q;
vector<int> heapIndex;
int count;
class compair{
	public:
	bool operator()(pair<int,int> x,pair<int,int> y){
		return (x>y);
	}
};
compair comp;
void push(int k,int index)
{	
	while (index>0 && comp(Q[(index-1)/2],Q[index]))
	{
	  pair<int,int> swapp = Q[index];
	  Q[index] = Q[(index-1)/2];
	  Q[(index-1)/2]=swapp;
	  heapIndex[Q[index].second] = index;	  
	  index = (index-1)/2;	  
	  heapIndex[Q[index].second] = index;
	}
	heapIndex[k] = index;
}
pair<int,int> pop()
{
	pair<int,int> p = Q.front();
	Q[0]=Q[Q.size()-1];
	heapIndex[Q[0].second]=0;
	Q.pop_back();
	int index = 0;
	int minindex;
	do{
		 minindex = index;
		int left = 2*index+1;
		int right = 2*index+2;
		if (left<Q.size() && comp(Q[index],Q[left]))
			minindex = left;
		if (right<Q.size() &&comp(Q[minindex],Q[right]))
			minindex = right;
		if (minindex!=index)
		{
			pair<int,int> swapp = Q[minindex];
			Q[minindex] = Q[index];
			Q[index] = swapp;
			heapIndex[Q[index].second] = index;
			heapIndex[Q[minindex].second] = minindex;
		}
	}while (minindex!=index);
	return p;
}
void dijkstra(int n)
{
	while (!Q.empty()){
		int cst,k;
		do{
			pair<int,int> fe= pop();
			cst = fe.first;
			k = fe.second;	
		}while (visited[k] && !Q.empty());
		if (!visited[k]){
			visited[k]=true;
			path[k] = cst;
			for (int i=0;i<adj[k].size();i++)
			{
				if (!visited[adj[k][i]])
				{
					int s=cost[k][i]+cst;
					if (path[adj[k][i]]==INT_MAX){
						pair<int,int> t(s,adj[k][i]);
						path[adj[k][i]] = s;
						Q.push_back(t);
						int index = Q.size()-1;
						push(adj[k][i],index);
					}
					else if (path[adj[k][i]]>s)
					{
						int index = heapIndex[adj[k][i]];
						path[adj[k][i]] = s;
						Q[index].first =s;
						push(adj[k][i],index);
					}
				}
			}
		}
	}
}
int main()
{
	FILE *f = fopen("dijkstra.in","r");
	FILE *g = fopen("dijkstra.out","w+");
	int n,m;
	fscanf(f,"%d %d",&n,&m);
	adj.resize(n+1);
	visited.resize(n+1);
	path.resize(n+1);
	cost.resize(n+1);
	heapIndex.resize(n+1);
	for (int i=0;i<=n;i++){
		visited[i]= false;
		path[i] = INT_MAX;
	}
	for (int i=0;i<m;i++)
	{
		int a,b,c;
		fscanf(f,"%d %d %d", &a,&b,&c);
		adj[a].push_back(b);		
		cost[a].push_back(c);
	}
	pair<int,int> r;
	r.first = 0;
	r.second = 1;
	Q.push_back(r);
	//make_heap(Q.begin(),Q.end());
	dijkstra(n);
	for (int i=2;i<=n;i++)
		if (path[i]==INT_MAX)
			fprintf(g,"0 ");
		else
			fprintf(g,"%d ",path[i]);
	fclose(f);
	fclose(g);
}