/* tanishqg5325 */

#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
#define pb push_back
#define X first
#define Y second
#define all(v) (v).begin(),(v).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;

ll f(ll w, int i, int j) {
    if(i == j) return w;
    if(i == 0 && j == 1) return 0;
    if(i == 0 && j == 2) return 2*w;
    if(i == 0 && j == 3) return w;
    if(i == 1) return 2*w;
    return 0;
}

void solve() {
    int n,m; cin>>n>>m;
    vector<pil > g[n];
    for(int i=0;i<m;i++) {
        int u,v; ll w;
        cin>>u>>v>>w; u--; v--;
        g[u].pb({v, w}); g[v].pb({u, w});
    }
    ll dp[4][n]; // 1 -> 0, 2 -> double
    for(int i=0;i<4;i++) for(int j=0;j<n;j++) dp[i][j] = LLONG_MAX; 
    dp[0][0] = 0;
    set<pair<ll, pii> > s;
    s.insert({dp[0][0], {0, 0}});
    vector<int> v[4] = {{0, 1, 2, 3}, {1, 3}, {2, 3}, {3}};
    while(!s.empty()) {
        pair<ll, pii> p = *(s.begin());
        s.erase(s.begin());
        for(int i : v[p.Y.Y]) {
            for(pil& v : g[p.Y.X]) {
                if(p.X + f(v.Y, p.Y.Y, i) < dp[i][v.X]) {
                    if(dp[i][v.X] != LLONG_MAX) s.erase(s.find({dp[i][v.X], {v.X, i}}));
                    dp[i][v.X] = p.X + f(v.Y, p.Y.Y, i);
                    s.insert({dp[i][v.X], {v.X, i}});
                }
            }
        }
    }
    for(int i=1;i<n;i++) cout<<dp[3][i]<<" "; cout<<"\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int t = 1; // cin >> t;
    while(t--) solve();
}
