#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

//  Algoritmul lui Dijkstra

struct Nod {
    int val;
    int lg;

    Nod(int v, int l) {
        val = v;
        lg = l;
    }
    operator int() { return lg; }
};

void parcurge(int index, int distance, vector<vector<Nod>> &noduri, vector<int> &minim) {
    if (minim[index] < 0 || distance < minim[index]) {
        minim[index] = distance;

        for (int i = 0; i < noduri[index].size(); i++)
            parcurge(noduri[index][i].val, distance + noduri[index][i].lg, noduri, minim);
    }
}

int main() {
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);
    int n, m, x, y, lg;
    scanf("%d %d", &n, &m);
    vector<vector<Nod>> noduri(n + 1);
    vector<int> minim(n + 1, -1);
    while (m--) {
        scanf("%d %d %d", &x, &y, &lg);
        noduri[x].push_back(Nod(y, lg));
        noduri[y].push_back(Nod(x, lg));
    }
    for (x = 1; x <= n; x++)
        sort(noduri[x].begin(), noduri[x].end());
    parcurge(1, 0, noduri, minim);

    for (x = 2; x <= n; x++)
        printf("%d ", minim[x]);
    return 0;
}