#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧  
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
　　　　 （ ´_ゝ`）　/　 ⌒i     
　　　　／　　　＼　 　  |　|     
　　　 /　　 /￣￣￣￣/　　|  
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿  
　 　　　＼/＿＿＿＿/　（u　⊃  
---------------------------------------------------------------------------------------------------*/












int N, M;
vector<pair<int, int>> E[101010];
//---------------------------------------------------------------------------------------------------
int vis[201010];
vector<ll> dijk() {
    vector<ll> D(N); vector<int> vis(N);
    rep(i, 0, N) D[i] = infl;
    rep(i, 0, N) vis[i] = 0;

    min_priority_queue<pair<ll, int>> que;

    D[0] = 0;
    que.push({ 0, 0 });

    while (!que.empty()) {
        auto q = que.top(); que.pop();

        ll cst = q.first;
        int cu = q.second;

        if (vis[cu]) continue;
        vis[cu] = 1;

        fore(p, E[cu]) {
            ll cst2 = cst + p.second;
            int to = p.first;

            if (chmin(D[to], cst2)) que.push({ D[to], to });
        }
    }

    return D;
}
//---------------------------------------------------------------------------------------------------
vector<ll> dijk2() {
    vector<ll> D(N * 2); vector<int> vis(N * 2);
    rep(i, 0, N * 2) D[i] = infl;
    rep(i, 0, N * 2) vis[i] = 0;

    min_priority_queue<pair<ll, int>> que;

    D[0] = 0;
    que.push({ 0, 0 });

    while (!que.empty()) {
        auto q = que.top(); que.pop();

        ll cst = q.first;
        int cu = q.second / 2;
        int pr = q.second % 2;

        if (vis[q.second]) continue;
        vis[q.second] = 1;

        fore(p, E[cu]) {
            ll cst2 = cst + p.second;
            int to = p.first;

            if (chmin(D[to * 2 + pr], cst2)) que.push({ D[to * 2 + pr], to * 2 + pr });

            if (pr == 0) {
                if (chmin(D[to * 2 + 1], cst)) que.push({ D[to * 2 + 1], to * 2 + 1 });
            }
        }
    }

    return D;
}
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N >> M;
    rep(i, 0, M) {
        int a, b, c;
        cin >> a >> b >> c;
        a--; b--;
        E[a].push_back({ b,c });
        E[b].push_back({ a,c });
    }

    auto d1 = dijk();
    auto d2 = dijk2();

    rep(i, 0, N) {
        ll ans = d1[i] + min(d2[i * 2], d2[i * 2 + 1]);
        printf("%lld\n", ans);
    }
}