// cout << "Case #" << test << ": ";
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 2019
using namespace std;
using P = pair<ll, ll>;
vector<ll> Dijkstra_list(int n, int s, vector<vector<pair<ll, ll>>> &Edge) {
    vector<bool> visited(n, false); //確定済み
    vector<ll> d(n, __LONG_LONG_MAX__ / 3);
    // using P = pair<ll,ll>
    priority_queue<P, vector<P>, greater<P>> que; //頂点とsからの距離
    d[s] = 0;
    que.push(make_pair(0, s));
    while(!que.empty()) {
        auto now = que.top();
        que.pop();
        visited[now.second] = true;
        for(auto e : Edge[now.second]) {
            if(visited[e.second])
                continue;
            if(d[e.second] > d[now.second] + e.first) {
                d[e.second] = d[now.second] + e.first;
                que.push(make_pair(d[e.second], e.second));
            }
        }
    }
    return d;
}
int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<P>> edgetik(n * 2), edge(n);
    for(int i = 0; i < m; i++) {
        int u, v;
        ll c;
        cin >> u >> v >> c;
        u--, v--;
        edge[u].push_back(make_pair(c, v));
        edge[v].push_back(make_pair(c, u));
        edgetik[u * 2].push_back(make_pair(c, v * 2));
        edgetik[u * 2 + 1].push_back(make_pair(c, v * 2 + 1));
        edgetik[v * 2].push_back(make_pair(c, u * 2));
        edgetik[v * 2 + 1].push_back(make_pair(c, u * 2 + 1));
        edgetik[u * 2].push_back(make_pair(0, v * 2 + 1));
        edgetik[v * 2].push_back(make_pair(0, u * 2 + 1));
    }
    auto d = Dijkstra_list(n, 0, edge);
    auto dtik = Dijkstra_list(n * 2, 0, edgetik);
    for(int i = 0; i < n; i++) {
        cout << d[i] + min(dtik[2 * i], dtik[2 * i + 1]) << endl;
    }
}