#include<bits/stdc++.h>
#define rep(i,n,m) for(int i = (n); i <(m); i++)
#define rrep(i,n,m) for(int i = (n) - 1; i >=(m); i--)
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const int MAX_N = 100000;

struct edge{int to, weight;};
vector<edge> from[MAX_N];

int main()
{
    int n, m;
    cin >> n >> m;

    rep(i, 0, m)
    {
        int a, b, c;
        cin >> a >> b >> c;
        --a, --b;

        edge e{b, c};
        from[a].push_back(edge{b, c});
        from[b].push_back(edge{a, c});        
    }

    vector<ll> dis(n, -1);
    priority_queue<pll, vector<pll>, greater<pll>> que;
    que.push(make_pair(0, 0));
    while (que.size() > 0)
    {
        ll node, distance;
        tie(node, distance) = que.top();
        que.pop();

        if (dis[node] != -1) continue;

        dis[node] = distance;
        for (edge e: from[node])
            que.push(make_pair(e.to, (ll)distance + e.weight));
    }

    vector<ll> dis_zero(n, -1);
    que.push(make_pair(0, 0));
    while (que.size() > 0)
    {
        ll node, distance;
        tie(node, distance) = que.top();
        que.pop();

        if (dis_zero[node] != -1 and dis_zero[node] < distance) continue;

        dis_zero[node] = distance;
        for (edge e: from[node])
        {
            que.push(make_pair(e.to, dis[node]));
            que.push(make_pair(e.to, (ll) dis_zero[node] + e.weight));
        }
    }

    rep(i, 0, n)
        cout << (ll) dis[i] + dis_zero[i] << endl;
        // cout << dis[i] << endl;
    return 0;
}