#include <cstdio>
#include <deque>
using namespace std;

const int MAXN=100005,MAXM=200005;
const int oo=~0u>>2;

struct Node
{
	int v,w;
	Node *next;
	Node(int _v,int _w,Node *_next):
		v(_v),w(_w),next(_next){}
	Node(){}
	void *operator new (size_t,void *p){return p;}
}*adj[MAXN],pool[MAXM*2],*mem=pool;
	
inline void addedge(int u,int v,int w)
{
	adj[u]=new (mem++)Node(v,w,adj[u]);
	adj[v]=new (mem++)Node(u,w,adj[v]);
}

int N,M;
int dis[MAXN];
Node *before[MAXN];
void spfa()
{
	for(int i=1;i<=N;i++)
		dis[i]=oo;
	deque<int> q;
	q.push_back(1);
	dis[1]=0;
	while(q.size())
	{
		int u=q.front();
		int dt;
		q.pop_front();
		for(Node *p=adj[u];p;p=p->next)
			if (dis[p->v]>(dt=dis[u]+p->w))
			{
				dis[p->v]=dt;
				before[p->v]=p;
				if (q.empty() || dis[q.front()]<dt)
					q.push_back(p->v);
				else
					q.push_front(p->v);
			}
	}
}

int calcu(int t)
{
	for(int i=1;i<=N;i++)
		dis[i]=oo;
	deque<int> q;
	q.push_back(1);
	dis[1]=0;
	while(q.size())
	{
		int u=q.front();
		int dt;
		q.pop_front();
		for(Node *p=adj[u];p;p=p->next)
			if (dis[p->v]>(dt=dis[u]+p->w) && p!=before[t])
			{
				dis[p->v]=dt;
				before[p->v]=p;
				if (q.empty() || dis[q.front()]<dt)
					q.push_back(p->v);
				else
					q.push_front(p->v);
			}
	}	
	if (dis[t]==oo) return -1;
	else return dis[t];
}

int main()
{
	freopen("travel.in","r",stdin);
	freopen("travel.out","w",stdout);
	scanf("%d%d",&N,&M);
	for(int i=0;i<M;i++)
	{
		int u,v,w;
		scanf("%d%d%d",&u,&v,&w);
		addedge(u,v,w);
	}
	spfa();
	for(int i=2;i<=N;i++)
		printf("%d\n",calcu(i));
	return 0;
}