//ROY FLOYD

#include <iostream>
#include <queue>
#include <vector>
#include <fstream>
#include <climits>

using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int n, m, x, y, c;
vector <int> D[10000005];
vector <pair<int, int>> L[10000005];

int main() {
    fin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == j) {
                D[i][j] = 0;
            } else {
                D[i][j] = INT_MAX;
            }
        }
    }
    for (int i = 1; i <= m; i++) {
        fin >> x >> y >> c;
        D[x][y] = min(D[x][y], c);
    }
    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                if (D[i][k] != INT_MAX && D[k][j] != INT_MAX) {
                    D[i][j] = min(D[i][j], D[i][k] + D[k][j]);
                }
            }
        }
    }
    int s = 1;

    for (int i = 2; i <= n; i++) {
        int distanta = D[s][i];

        if (distanta == INT_MAX) {
            fout << 0 << " ";
        } else {
            fout << distanta << " ";
        }
    }
    fout << endl;
    return 0;
}