#include <cmath>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <cassert>
#include <unordered_map>
#include <iomanip>
#include <bitset>
#include <cstdio>

using namespace std;

typedef long long ll;
const int N = (int) 1e5 + 7;
const ll INF = (ll) 1e18 + 7;
int n;
int m;
vector<pair<int, int>> g[N];
ll d[N];

int main() {
    freopen ("dijkstra.in", "r", stdin);
    freopen ("dijkstra.out", "w", stdout);
    cin >> n >> m;
    //cout << n << " " << m << "\n";
    for (int i = 1; i <= m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        g[a].push_back({b, c});
        g[b].push_back({a, c});
    }
    for (int i = 2; i <= n; i++) d[i] = INF;
    priority_queue<pair<ll, int>> pq;
    pq.push({0, 1});
    while (!pq.empty()) {
        auto it = pq.top();
        pq.pop();
        it.first *= -1;
        int v = it.second;
        if (d[v] != it.first) continue;

        for (auto &ve : g[v]) {
            int to = ve.first;
            ll u = d[v] + ve.second;
            if (u < d[to]) {
                d[to] = u;
                pq.push({-d[to], to});
            }
        }
    }
    for (int i = 2; i <= n; i++) {
        if (d[i] == INF) {
            d[i] = -1;
        }
        cout << d[i] << " ";
    }
    cout << "\n";
}