#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

using namespace __gnu_pbds;
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
#define cin in
#define cout out

#define int long long

const int INF = 1e17 + 5;

vector<vector<pair<int,int> > > g;
int dist[60000];
void solve() {
    int n,m;
    cin >> n >> m;
    g.resize(n + 1);
    for(int i = 0;i<m;++i) {
        int x,y,z;
        cin >> x >> y >> z;
        g[x].push_back({z,y});
        g[y].push_back({z,x});
    }
    priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int>>> pq;
    for(int i = 1;i<=n;i++) dist[i] = INF;
    dist[1] = 0;
    pq.push({0,1});
    while(!pq.empty()) {
        pair<int,int> top = pq.top();
        pq.pop();
        int u = top.second;
        for(auto i : g[u]){
            int v = i.second;
            int w = i.first;
            if(dist[v] > dist[u] + w) {
                dist[v] = dist[u] + w;
                pq.push({dist[v],v});
            }
        }
    }
    for(int i = 2;i<=n;i++) {
        cout << dist[i] << ' ';
    }
}

int32_t main() {
    int tt;
    tt = 1;
    while(tt--) {
        solve();
    }
}