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

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

const int INF = 1e9;
set <pair<int,int> > g[50010];
set <pair<int,int> > d;
int dist[50010];


int main()
{
    int n, m; fin >> n >> m;

    for(int i = 1; i <= m; ++i) {
        int u, v, c; fin >> u >> v >> c;
        g[u].insert({v,c});
        g[v].insert({u,c});
    }

    for(int i = 1; i <= n; ++i)
        dist[i] = INF;
    dist[1] = 0;

    d.insert({1, 0});

    while(!d.empty()) {
        int node = d.begin()->first;
        dist[node] = d.begin()->second;

        d.erase(d.begin());

        for(auto v : g[node]) {
            int nod = v.first;
            int cost = v.second;
            if(dist[nod] > dist[node] + cost) {
                if(dist[nod] != INF)
                    d.erase(d.find({nod, dist[nod]}));
                dist[nod] = dist[node] + cost;
                d.insert({nod, dist[nod]});
            }
        }
    }

    for(int i = 2; i <= n; ++i)
        if(dist[i] == INF) fout << "0 ";
        else  fout << dist[i] << " ";

    return 0;
}