#include <bits/stdc++.h>
using namespace std;

constexpr long long INF = 1'000'000'000'000'000'000L;

struct Edge{
    int to;
    long long cost;
    Edge(int to, long long cost):to(to), cost(cost) {}
};


vector<long long> dijkstra(int start, const vector<vector<Edge>> &Es){
    int N = Es.size();
    vector<long long> dist(N, INF);
    dist[start] = 0;
    priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<>> pq;
    pq.push(make_pair(0, start));
    while (not pq.empty()){
        long long d;
        int v;
        tie(d, v) = pq.top();
        pq.pop();
        if (d > dist[v]) continue;
        dist[v] = d;
        for (auto &uc : Es[v]){
            int u = uc.to;
            long long new_d = d + uc.cost;
            if (new_d < dist[u]){
                dist[u] = new_d;
                pq.push(make_pair(new_d, u));
            }
        }
    }
    return dist;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, M;
    cin >> N >> M;
    vector<vector<Edge>> Es(2 * N, vector<Edge>());
    for (int m = 0; m != M; ++m){
        int a, b;
        long long c;
        cin >> a >> b >> c;
        --a;
        --b;
        Es[a].emplace_back(Edge(b, c));
        Es[b].emplace_back(Edge(a, c));
        Es[a].emplace_back(Edge(N + b, 0));
        Es[b].emplace_back(Edge(N + a, 0));
        Es[N + a].emplace_back(Edge(N + b, c));
        Es[N + b].emplace_back(Edge(N + a, c));
    }
    auto dist = dijkstra(0, Es);
    dist[N] = 0;
    for (int i = 0; i < N; ++i){
        cout << dist[i] + dist[i + N] << '\n';
    }
    return 0;
}