// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;

#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

using Graph = vector< vector< pair<int, int> > >;
int N, M;
int dist[100010][2];

struct Elem {
    int pos, mode, cost;
    Elem() {}
    Elem(int p, int m, int c) : pos(p), mode(m), cost(c) {}
    bool operator<(const Elem &e) const {
        return cost > e.cost;
    }
};
 
signed main() {
    scanf("%lld%lld", &N, &M);
    Graph G(N);
    for(int i=0; i<M; i++) {
        int u, v, w; scanf("%lld%lld%lld", &u, &v, &w);
        u--; v--;
        G[u].emplace_back(v, w);
        G[v].emplace_back(u, w);
    }

    fill(dist[0], dist[N], INF);
    dist[0][0] = dist[0][1] = 0;

    priority_queue<Elem> que;
    que.emplace(0, 0, 0);
    while(que.size()) {
        auto cur = que.top(); que.pop();
        if(dist[cur.pos][cur.mode] < cur.cost) continue;

        for(auto e : G[cur.pos]) {
            int u = cur.pos, v = e.first, w = e.second;
            int new_cost = cur.cost + w;
            // そのまま進む
            if(dist[v][cur.mode] > new_cost) {
                dist[v][cur.mode] = new_cost;
                que.emplace(v, cur.mode, new_cost);
            }
            // 0 -> 1
            if(cur.mode == 0) {
                if(dist[v][1] > cur.cost) {
                    dist[v][1] = cur.cost;
                    que.emplace(v, 1, cur.cost);
                }
            }
        }
    }

    for(int i=0; i<N; i++) {
        int ans = dist[i][0] + dist[i][1];
        printf("%lld\n", ans);
    }
    return 0;
}