#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define I 1<<30
#define F first
#define S second
#define N 50001
#define M 6000000
set<pair<int,int> > c;
int n,m,d[N],x,y,z,b,i,j,k,o,l;
vector<pair<int,int> > a[N];
char r[M];
inline int A()
{
  	int s=0;
  	for(;r[o]<'0'||r[o]>'9';o++);
  	for(;r[o]>='0'&&r[o]<='9';o++)
  		s=s*10+r[o]-'0';
  	return s;
}
inline void S(int x)
{
    int i,d=x<10?1:x<100?2:x<1000?3:x<10000?4:5;
    for(i=d-1;i>=0;x/=10,i--)
        r[l+i]=x%10+48;
    r[l+d]=32,l+=d+1;
}
int main()
{
    freopen("dijkstra.in","r",stdin),freopen("dijkstra.out","w",stdout),fread(r,1,M,stdin),n=A(),m=A();
	while(m--)
	  	x=A(),y=A(),z=A(),a[x].pb({y,z});
    for(i=2;i<=n;i++)
        d[i]=I;
	for(c.insert({0,1});!c.empty();)
		for(i=c.begin()->S,c.erase(c.begin()),k=a[i].size(),j=0;j<k;j++)
            if(d[i]+a[i][j].S<d[a[i][j].F])
            {
                if(d[a[i][j].F]!=I)
                    c.erase(c.find({d[a[i][j].F],a[i][j].F}));
                d[a[i][j].F]=d[i]+a[i][j].S,c.insert({d[a[i][j].F],a[i][j].F});
            }
	for(i=2;i<=n;i++)
        S((d[i]==I?0:d[i]));
    fwrite(r,1,l,stdout);
}