#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

const ll inf = LONG_LONG_MAX / 2 - 1;
ll n, m;
vector<vector<pair<ll, ll>>> g;
vector<vector<ll>> dp;

void dfs(ll v, ll p = -1) {
    for(auto &x : g[v]) {
        ll u = x.first, cost = x.second;
        if (u == p) continue;
        bool upd = false;
        if (dp[u][0] > (dp[v][0] + cost)) {
            upd = true;
            dp[u][0] = dp[v][0] + cost;
        }
        if (dp[u][1] > dp[v][0]) {
            upd = true;
            dp[u][1] = dp[v][0];
        }
        if (dp[u][1] > (dp[v][1] + cost)) {
            upd = true;
            dp[u][1] = dp[v][1] + cost;
        }
        if (upd) dfs(u, v);
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    cin >> n >> m;
    g.resize(n);
    rep(i, m) {
        ll a, b, c;
        cin >> a >> b >> c;
        a--; b--;
        g[a].push_back(make_pair(b, c));
        g[b].push_back(make_pair(a, c));
    }
    dp.resize(n, vector<ll>(2, inf));
    dp[0][0] = 0; dp[0][1] = 0;
    dfs(0);
    rep(i, n) {
        ll tmp = dp[i][0] + dp[i][1];
        printf("%lld\n", tmp);
    }
    return 0;
}