#include <bits/stdc++.h>

#define int long long
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;

const int MAX_N = 1e5+10;
struct Edge{ int to, cost; };
vector<Edge> es[MAX_N];
ll d[MAX_N*2];
signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    rep(i, m) {
        int a, b, c;
        cin >> a >> b >> c;
        --a;
        --b;
        es[a].pb({b, c});
        es[b].pb({a, c});
    }
    rep(i, MAX_N*2) d[i] = 1e18;
    int root = 0;
    auto dijkstra = [&] () {
        typedef pair<int, int> P; //dist, from
        priority_queue<P, vector<P>, greater<P> > q;
        d[root] = 0LL;
        d[root+1] = 0LL;
        q.push({0LL, root});
        while (!q.empty()) {
            auto p = q.top(); q.pop();
            int prv = p.se;
            auto cost = p.fi;
            if (d[prv] < p.fi) continue;
            int cur = prv / 2;
            int flag = prv&1LL;
            for (auto& e : es[cur]) {
                int to = e.to;
                if(d[to*2+flag] > d[prv] + e.cost) {
                    d[to*2+flag] = d[prv] + e.cost;
                    q.push({d[to*2+flag],to*2+flag});
                }
                if(flag == 0 && d[to*2+1] > d[prv]) {
                    d[to*2+1] = d[prv];
                    q.push({d[to*2+1], to*2+1});
                }
            }
        }
    };
    dijkstra();
    rep(i, n) {
        cout << d[i*2] + d[i*2+1] << '\n';
    }
    // rep(i, n) {
    //     cout << d[i*2] << " " << d[i*2+1] << endl;
    // }
    return 0;
}