#include <iostream>
#include <fstream>
using namespace std;
const long int INFINIT=1<<30;

long int c[10000][10000],n,m,i,j,x,y,cost;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

void initializare(long int &n,long int &m)
{
    f>>n>>m;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            if(i!=j)
                c[i][j]=INFINIT;
            else
                c[i][j]=0;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>cost;
        c[x][y]=cost;
    }
}

void dijkstra(int x0)
{
    int i, min, k, ok;
    long int viz[n], d[n];
    for (i = 1; i<=n; i++) {
        d[i] = c[x0][i];
        viz[i] = 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];
               }
        }
        else ok = 0;
    }
    for(i=2;i<=n;i++)
        if(d[i]!=INFINIT)
            g<<d[i]<<" ";
        else
            g<<0<<" ";
}

int main()
{
    initializare(n,m);
    dijkstra(1);
    return 0;
}