#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os, const map<T,U>& mp){ os << "{"; for(auto& p : mp){ os << p << ","; } os << "}"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int,int>;
using vi = std::vector<int>;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

struct edge{
    int from,to;
    ll cost;
    edge(){}
    edge(int f,int t,ll c) : from(f), to(t), cost(c){}
};

int main(){
    int n,m; cin >> n >> m;
    vector<vector<edge>> g(n);
    rep(i,m){
        int a,b,c;
        cin >> a >> b >> c;
        a--; b--;
        g[a].emplace_back(a,b,c);
        g[b].emplace_back(b,a,c);
    }


    using Vertex = tuple<int,int>;
    using State = pair<ll,Vertex>;
    priority_queue<State, vector<State>, greater<State>> que;
    vector<vector<ll>> d(n, vector<ll>(2,LINF));
    d[0][0] = 0;
    d[0][1] = 0;
    que.push(State(0,Vertex(0,0)));
    que.push(State(0,Vertex(0,1)));
    while(!que.empty()){
        ll dist;
        Vertex ver;
        tie(dist,ver) = que.top();
        que.pop();

        int v,f; tie(v,f) = ver;
        if(d[v][f] < dist) continue;
        for(auto& e : g[v]){
            int to = e.to;

            // not ticket
            if(d[to][f] > dist + e.cost){
                d[to][f] = dist + e.cost;
                que.push(State(d[to][f], Vertex(to,f)));
            }

            if(f == 0 && d[to][1] > dist){
                d[to][1] = dist;
                que.push(State(dist,Vertex(to,1)));
            }
        }
    }


    for(int i=0;i<n;i++){
        cout << d[i][0] + d[i][1] << endl;
    }
}