#include <bits/stdc++.h>
#define N 50005
using namespace std;

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

vector<pair<int, int>> g[N];
queue<pair<int, int>> q;
int viz[N], d[N], t[N];
int n, m;

void afis(){
    for(int i = 1; i <= n; ++i){
        fout << i << ' ';
        for(auto nod : g[i]){
            fout << nod.first << " " << nod.second;
        }
        fout << '\n';
    }
}

void dijkstra(){
    int start = 1;
    for(int i = 1;i <= n; ++i)
        d[i] = INT_MAX, t[i] = 0;
    d[start] = 0;
    q.emplace(0, start);
    while(!q.empty()){
        int nod = q.front().second;
        q.pop();
        if(!viz[nod]){
            viz[nod] = 1;
            for(auto pair : g[nod]){
                int vecin = pair.first;
                int cost = pair.second;
                if(d[nod] + cost < d[vecin]){
                    d[vecin] = d[nod] + cost;
                    q.emplace(-d[vecin], vecin);
                }
            }
        }
    }

}

int main() {
    fin >> n >> m;
    for(int i = 0; i < m; ++i) {
        int x, y, z;
        fin >> x >> y >> z;
        g[x].emplace_back(y, z);
        g[y].emplace_back(x, z);
    }
    dijkstra();
    for(int i = 2; i <= n; ++i)
        if(d[i] != INT_MAX)
            fout << d[i] <<" ";
        else
            fout << 0 << " ";
    return 0;
}