#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

#define ff               first
#define ss               second
#define pb               push_back
#define all(x)           (x).begin(), (x).end()
#define mem0(x)          memset(x, 0, sizeof (x))
#define mem1(x)          memset(x, -1, sizeof (x))

typedef long long ll;
#define int ll
typedef vector <int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector <ii> vii;
typedef vector<vii> vvii;

vvii g;

void addEdge(int u, int v, int w){
    u *= 4, v *= 4;
    g[u].pb({w, v});
    g[u].pb({2*w, v+2});
    g[u].pb({0, v+1});
    g[u].pb({w, v+3});

    g[u+1].pb({w, v+1});
    g[u+1].pb({2*w, v+3});

    g[u+2].pb({w, v+2});
    g[u+2].pb({0, v+3});

    g[u+3].pb({w, v+3});
}

int32_t main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m; cin >> n >> m;
    g.assign(4*n, vii());
    for (int i = 0; i < m; ++i) {
        int u, v, w; cin >> u >> v >> w; u--, v--;
        addEdge(u, v, w);
        addEdge(v, u, w);
    }
    priority_queue<ii> q;
    q.push({0,0}); // d, u, min, max
    ll inf = 1e18;
    vi dis(4*n, inf);
    dis[0] = 0;
    while (q.size()){
        int d = -q.top().ff;
        int u = q.top().ss; q.pop();
        if (dis[u] < d) continue;
        for (ii e: g[u]){
            int v = e.ss, w = e.ff;
            if (dis[v] > d + w){
                dis[v] = d + w;
                q.push({-(d + w), v});
            }
        }
    }
    for (int i = 1; i < n; ++i) {
        cout << dis[4*i+3] << " ";
    }
}