#include <fstream>
#include <iostream>
#include <vector>
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int main()
{
    int C[500][500];

    int n,m,i,j,mi,k,ok,x0=1,x,y,c;
    int viz[50001],d[50001],tata[50001];
    fin>>n>>m;

    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
           C[i][j]=30000;

    for(i=1;i<=m;i++)
    {
     fin>>x>>y>>c;
     C[x][y]=c;
    }

    for (i = 1; i<=n; i++)
    {
        d[i] = C[x0][i];
        tata[i] = x0;
        viz[i] = 0;
    }
    d[x0]=0;
    tata[x0] = 0;
    viz[x0] = 1; ok = 1;
    while (ok)
     {
        mi = 30000;
        for (i = 1; i<=n; i++)
            if (!viz[i] && mi>d[i])
            {
                mi = d[i];
                k = i;
            }
        if (mi != 30000)
        {
            viz[k] = 1;
            for (i = 1; i<=n; i++)
               if (!viz[i] && d[i]>d[k]+C[k][i])
               {
                   d[i] = d[k]+C[k][i];
                   tata[i] = k;
               }
        }
        else ok = 0;
    }
  for(i=2;i<=n;i++)
      if(d[i]==30000) fout<<"0"<<" ";
         else  fout<<d[i]<<" ";


 return 0;
}