#include <bits/stdc++.h>
#define inf 1e9
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector <pair <int, int>> G[50005];
set <pair <int, int>> s;
int d[50005];
bool viz[50005];
void dijkstra(){
    d[1] = 0;
    s.insert({0,1});
    while(!s.empty()){
        auto it = s.begin();
        int nod = it->second;
        s.erase(it);
        if(viz[nod]) continue;
        viz[nod] = 1;
        for(auto x : G[nod]){
            if(!viz[x.second] && d[nod] + x.first < d[x.second]){
                d[x.second] = d[nod] + x.first;
                s.insert({d[x.second],x.second});
            }
        }
    }
}
int main()
{
    int n,m,i,u,v,c;
    fin >> n >> m;
    for(i = 1; i <= n; i++) d[i] = inf;
    for(i = 1; i <= m; i++){
        fin >> u >> v >> c;
        G[u].push_back({c,v});
        G[v].push_back({c,u});
    }
    dijkstra();
    for(i = 2; i <= n; i++) fout << (d[i] != inf ? d[i] : 0) << " ";
    return 0;
}