#include <iostream>
#include <fstream>
#include <vector>
#define inf 0x3f3f3f3f

using namespace std;

vector <vector <pair <int, int>>> v(50000);

vector <int> dijkstra(int s, int n) {
    vector <int> d(n + 1, inf);
    vector <bool> sel(n + 1, false);
    d[s] = 0;
    int minim, curr, dest, cost;
    for (int i = 1; i <= n; i++) {
        minim = inf;
        for (int j = 1; j <= n; j++) {
            if (d[j] < minim && !sel[j]) {
                curr = j;
                minim = d[j];
            }
        }
        sel[curr] = true;
        for (auto muchie: v[curr]) {
            dest = muchie.first;
            cost = muchie.second;
            if (d[dest] > d[curr] + cost)
                d[dest] = d[curr] + cost;
        }
    }
    return d;
}

int main()
{
    int n, m, a, b, c;
    ifstream in("dijkstra.in");
    ofstream out("dijkstra.out");
    in >> n >> m;
    for (int i = 0; i < m; i++) {
        in >> a >> b >> c;
        v[a].push_back(make_pair(b, c));
    }
    vector <int> sol;
    sol = dijkstra(1, n);
    for (int i = 2; i <= n; i++)
        out << sol[i] << " ";
    return 0;
}