#include<iostream.h>
#include<fstream.h>
int i,j,k,n,m,a[250001][4],c[50001],ok;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int main()
{f>>n>>m;
for(i=2;i<=n;i++)
        c[i]=2000000000;
for(i=1;i<=m;i++)
        {f>>a[i][0]>>a[i][1]>>a[i][2];
          if(a[i][0]==1)c[a[i][1]]=a[i][2];}
c[1]=0;
int nr=1;
while(ok==0 && nr<n)
{  ok=1;
for(k=1;k<=m;k++)
         if(d[a[k][2]] > d[a[k][1]] + a[k][3])
                                 {c[a[k][1]]=c[a[k][0]]+a[k][2];
                                  ok=0;}
nr++;}
for(i=2;i<=n;i++)
     if(c[i]<2000000000)  g<<c[i]<<" ";
                else  g<<"0 ";
return 0;
}