#include <iostream>
#include <fstream>
#define MAX_NR 999999999
#define size 10000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int a[size][size];
bool s[size];
int d[size];
// int t[size];
int n, m;
int findNod() {
    int min = MAX_NR, aux = 0;
    for (int i = 1; i <= n; i++) {
        if (s[i] == 0 && d[i] < min) {
            min = d[i];
            aux = i;
        }
    }
    return aux;
}
int main()
{
    fin>>n>>m;
    int x, y, dist;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            a[i][j] = MAX_NR;
        }
    }
    for (int i = 1; i <= m; i++) {
        fin>>x>>y>>dist;
        a[x][y] = dist;
    }
    int R = 1;
    for (int i = 1; i <= n; i++) {
        if (a[R][i] == MAX_NR) {
            d[i] = MAX_NR;
        } else {
            d[i] = a[R][i];
            //t[i] = R;
        }
    }
    int k = findNod();
    s[R] = 1;
    while(k) {
        s[k] = 1;
        for (int i = 1; i <= n; i++) {
            if ((a[k][i] + d[k] < d[i] || d[i] == MAX_NR) && a[k][i] != 0) {
                d[i] = a[k][i] + d[k];
                //t[i] = k;
            }
        }
        k = findNod();
    }
    for(int i = 2; i <= n; i++) {
        if(d[i] != 0)
            fout<<d[i]<<' ';
        else
            fout<<"0 ";
    }
    fin.close();
    fout.close();
    return 0;
}