#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <queue>
using namespace std;
#define INF 1000000000
typedef pair<int, int> P;
typedef pair<long long int, P> T;
typedef struct edge {
    int to;
    long long int cost;
} edge;

int main() {
    int n, m;
    int a, b, c;
    cin >> n >> m;
    vector<edge> graph[n];
    long long int ans[2][10010];

    for(int i=0;i<10010;i++) {
        ans[0][i] = INF;
        ans[1][i] = INF;
    }

    ans[0][0] = 0;
    ans[1][0] = 0;
    edge e;
    for(int i=0;i<m;i++) {
        cin >> a >> b >> c;
        e.to = b-1;  e.cost = c;
        graph[a-1].push_back(e);
        e.to = a-1;  e.cost = c;
        graph[b-1].push_back(e);
    }
    priority_queue < T, vector<T>, greater<T> > que;
    que.push(T(0, P(1, 0)));
    while(!que.empty()) {
        T q = que.top();
        que.pop();

        long long cost = q.first;
        int point =  q.second.second;
        int ticket = q.second.first;
        if(cost > ans[ticket][point]) continue;

        for(int i=0;i<graph[point].size();i++) {
            int to1 = graph[point][i].to;
            int cost1 = graph[point][i].cost;

            if(ticket == 1) {
                if(cost < ans[0][to1]) {
                    que.push(T(cost, P(0, to1)));
                    ans[0][to1] = cost;
                }
            }

            if(cost1+cost < ans[ticket][to1]) {
                que.push(T(cost1+cost, P(ticket, to1)));
                ans[ticket][to1] = cost1+cost;
            } 
        }

    }
    for(int i=0;i<n;i++) {
        cout << ans[0][i]+ans[1][i] << endl;
    }
}
//拡張ダイクストラXD