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

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

vector<vector<int>> neighbours(50001);
vector<int> minimalLength(50001, -1);

void dijkstra(int node, int last) {
    for (int i = 0; i < neighbours[node].size(); i += 2) {
        if (minimalLength[neighbours[node][i]] == -1) {
            minimalLength[neighbours[node][i]] = neighbours[node][i + 1] + last;
            dijkstra(neighbours[node][i], neighbours[node][i + 1] + last);
        } else if (minimalLength[neighbours[node][i]] > last + neighbours[node][i + 1]) {
            minimalLength[neighbours[node][i]] = last + neighbours[node][i + 1];
            dijkstra(neighbours[node][i], last + neighbours[node][i + 1]);
        }
    }
}

int main() {
    int n, m;
    fin >> n >> m;
    for (int i = 1, x, y, z; i <= m; ++i) {
        fin >> x >> y >> z;
        neighbours[x].push_back(y);
        neighbours[x].push_back(z);
    }
    dijkstra(1, 0);
    for (int i = 2; i <= n; ++i) {
        if (minimalLength[i] == -1) {
            fout << "0 ";
            continue;
        }
        fout << minimalLength[i] << ' ';
     }

}