#include <algorithm>
#include <fstream>
#include <iostream>
#include <queue>
#include <vector>
#include <tuple>

using namespace std;

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

vector<vector<pair<int,int>>> lista;
vector<bool> viz;
vector<int> rez;
int main(){
    int n,m;
    fin >> n >> m;
    lista.resize(n+1);
    viz.resize(n+1, false);
    rez.resize(n+1, 0);

    for (int i = 1; i<=m; i++) {
        int u,v,c;
        fin>>u>>v>>c;
        lista[u].emplace_back(v,c);
        lista[v].emplace_back(u,c);
    }
    priority_queue<tuple<int,int,int>, vector<tuple<int,int,int>>, greater<>> pq;
    pq.emplace(0,1,-1);
    while (!pq.empty()) {
        auto [cost,u,tata] = pq.top();
        pq.pop();

        if (tata != -1) {
            if (rez[u] == 0 || (rez[u] > rez[tata] + cost)) {
                rez[u] = rez[tata] + cost;
            }
        }
        viz[u] = true;

        for (auto [v,c] : lista[u]) {
            if (!viz[v]) {
                pq.emplace(c,v,u);
            }
        }
    }

    for (int i = 2; i<=n; i++) {
        fout<<rez[i]<<" ";
    }
    return 0;
}