#include <bits/stdc++.h>

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

const int Inf = 1e9 + 5;
const int Dim = 1e5 + 5;

int n, m;
int d[Dim];

vector <pair<int, int> > G[Dim];

class comp {
public:
    bool operator() (const int &t1, const int &t2) {
        return d[t1] > d[t2];
    }
};

priority_queue <int, vector <int>, comp> coada;

int main() {
    f >> n >> m;
    for(int i = 1; i <= m; ++i) {
        int x, y, cost;
        f >> x >> y >> cost;
        G[x].push_back({y, cost});
        G[y].push_back({x, cost});
    }

    /*cin >> k;
    for(int i = 1; i <= k; ++i) {
        cin >> p[i];
    }

    cin >> s;*/ int s = 1;
    for(int i = 1; i <= n; ++i) d[i] = Inf;
    d[s] = 0;

    coada.push(s);
    while(!coada.empty()) {
        int node = coada.top();
        coada.pop();

        for(auto it = G[node].begin(); it != G[node].end(); ++it) {
            if(d[it -> first] > d[node] + it -> second) {
                d[it -> first] = d[node] + it -> second;
                coada.push(it -> first);
            }
        }
    }

    for(int i = 2; i <= n; ++i) {
        if(d[i] == Inf) d[i] = 0;
        g << d[i] << ' ';
    }
    return 0;
}