#include <fstream>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int i,n,m,j,mini,x,y,cost,k,d[501],s[501],t[501];
double long a[251][251];
int main()
{ f>>n>>m;
for(i=1;i<=n;++i)
    for(j=i+1;j<=n;++j)
{a[i][j]=32000;
 a[j][i]=32000;
}
  for(i=1;i<=m;++i)
  {f>>x>>y>>cost;
   a[x][y]=cost;
  }
  for(i=1;i<=n;++i)
   {d[i]=a[1][i];
   if(d[i]<32000)
     t[i]=1;}
   s[1]=1;
  t[1]=0;
  while(1)
  {mini=32000;
   for(i=1;i<=n;++i)
     if(s[i]==0&&d[i]<mini)
   {mini=d[i];
    k=i;

   }
   if(mini==32000)
     break;
   s[k]=1;
   for(i=1;i<=n;++i)
    if(s[i]==0&&d[i]>mini+a[k][i])
      {d[i]=a[k][i]+mini;
    t[i]=k;}

  }
  for(i=2;i<=n;++i)
    if(d[i]==32000)
      g<<0<<' ';
  else
    g<<d[i]<<' ';

    return 0;
}