#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
template<typename T> void print(T a) { cout << a << endl; }
template<typename T, typename... Ts> void print(T a, Ts... ts) { cout << a << ' '; print(ts...); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

#include <queue>
using T = tuple<ll, int, int>;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, m;
    cin, n, m;
    vector<vector<P>> G(n);
    REP(i, 0, m) {
        int a, b, c;
        cin, a, b, c;
        a--;
        b--;
        G[a].emplace_back(b, c);
        G[b].emplace_back(a, c);
    }
    priority_queue<T, vector<T>, greater<T>> pq;  // cost, to, used;
    pq.emplace(0, 0, 0);
    const ll inf = 1LL << 60;
    auto dp = make_v(2, n, inf);
    dp[0][0] = dp[1][0] = 0;
    while (pq.size()) {
        auto [cost, to, used] = pq.top();
        pq.pop();
        if (dp[used][to] < cost) continue;
        dp[used][to] = cost;
        for (auto [nto, ncost] : G[to]) {
            if (!used) {
                if (chmin(dp[1][nto], dp[used][to])) {
                    pq.emplace(dp[1][nto], nto, 1);
                }
            }
            if (chmin(dp[used][nto], dp[used][to] + ncost)) {
                pq.emplace(dp[used][nto], nto, used);
            }
        }
    }
    REP(i, 0, n) {
        cout << dp[0][i] + dp[1][i] << endl;
    }
    return 0;
}