#include <iostream>
#include <fstream>
using namespace std;
#define NMAX 9999
#define INFINIT 99999999
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n,C[NMAX][NMAX],na;


void dijkstra(int x0)
{
    int i, j, mini, k, ok;
    int viz[NMAX], d[NMAX], tata[NMAX];
    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) {
        mini = INFINIT;
        for (i = 1; i<=n; i++)
            if (!viz[i] && mini>d[i]) {
                mini = d[i];
                k = i;
            }
        if (mini != 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++) g<<d[i]<<' ';
}

int main()
{int i,j,l,c,x;f>>n>>na;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++) C[i][j]=INFINIT;


 for(i=1;i<=na;i++) {f>>l>>c>>x;C[l][c]=x;}
 dijkstra(1);


}