#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
#include <memory>
#include <regex>
using namespace std;

class Edge
{
public:
    int to, cost;
    Edge(int to, int cost){
        this->to = to;
        this->cost = cost;
    }
};

const long long INF = LLONG_MAX / 2;

int main()
{
    int n, m;
    cin >> n >> m;
    vector<vector<Edge> > edges(n);
    for(int i=0; i<m; ++i){
        int a, b, c;
        cin >> a >> b >> c;
        -- a;
        -- b;
        edges[a].push_back(Edge(b, c));
        edges[b].push_back(Edge(a, c));
    }

    vector<vector<long long> > dp(2, vector<long long>(n, INF));
    dp[0][0] = dp[1][0] = 0;
    priority_queue<tuple<long long, int, int> > pq;
    pq.push(make_tuple(-0, 0, 0));
    pq.push(make_tuple(-0, 1, 0));
    while(!pq.empty()){
        long long cost;
        int cnt, curr;
        tie(cost, cnt, curr) = pq.top();
        cost *= -1;
        pq.pop();
        if(dp[cnt][curr] < cost)
            continue;

        for(const Edge& e : edges[curr]){
            int next = e.to;
            if(cnt == 0 && cost < dp[1][next]){
                dp[1][next] = cost;
                pq.push(make_tuple(-cost, 1, next));
            }
            long long cost2 = cost + e.cost;
            if(cost2 < dp[cnt][next]){
                dp[cnt][next] = cost2;
                pq.push(make_tuple(-cost2, cnt, next));
            }
        }
    }

    for(int i=0; i<n; ++i){
        long long ans = dp[0][i] + dp[1][i];
        cout << ans << endl;
    }

    return 0;
}