#include <fstream>

const int INFINIT=150000;

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

long long c[5000][5000],d[5000],tata[5000],viz[5000],n,m,s;
void citire()
{ int i,j,x,y,cost;
  f>>n>>m;
  for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
      if(i==j) c[i][j]=0;
      else c[i][j]=INFINIT;
  for(i=1;i<=m;i++)
    { f>>x>>y>>cost;
      c[x][y]=cost;
    }
}

void dijkstra(int x0)
{

    int i, j, min, k, ok;
    for (i = 1; i<=n; i++) {
        d[i] = c[x0][i];
        tata[i] = x0;
        viz[i] = 0;
    }
    tata[x0] = 0;
    viz[x0] = 1; ok = 1;
    while (ok) {
        min = INFINIT;
        for (i = 1; i<=n; i++)
            if (!viz[i] && min>d[i]) {
                min = d[i];
                k = i;
            }
        if (min != INFINIT) {
            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]==INFINIT)
        d[i]=0;
        g<<d[i]<<" ";
    }
}
int main()
 { citire();
   s=1;
   dijkstra(s);
    return 0;
}