#include <bits/stdc++.h>
#define ft first
#define sc second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef map<ll, ll> Map;
static const ll INF=1e18;
static const ll MAX=1e5+7;
static const ll MOD=1e9+7;
ll max(ll a, ll b) {return a>b ? a:b;}
ll min(ll a, ll b) {return a<b ? a:b;}

class Edge {
    public:
    ll t, c;
    Edge(ll t, ll c) {
        this->t=t;
        this->c=c;
    }
};

class A {
    public:
    ll d, id, f;
    A(ll d, ll id, ll f) {
        this->d=d;
        this->id=id;
        this->f=f;
    }
    
    bool operator < (const A &a) const {
        return d<a.d;
    }
    
};

ll N, M;
vector<Edge> g[MAX];
ll d[MAX][2];

void dijkstra(ll s) {
    ll u, i;
    ll clr[MAX][2]={};
    for(i=0; i<N; i++) {
        d[i][0]=INF;
        d[i][1]=INF;
    }
    
    priority_queue<A> q;
    d[s][0]=0;
    d[s][1]=0;
    q.push(A(0, s, 0));
    
    while(q.size()) {
        A f=q.top(); q.pop();
        ll u=f.id;
        if(f.f==0) {
            if(d[u][0]==-f.d) {
                clr[u][0]=1;
                
                for(i=0; i<g[u].size(); i++) {
                    Edge e=g[u][i];
                    if(clr[e.t][0]==0 && d[e.t][0]>d[u][0]+e.c) {
                        d[e.t][0]=d[u][0]+e.c;
                        q.push(A(-d[e.t][0], e.t, 0));
                    }
                    
                    if(clr[e.t][1]==0 && d[e.t][1]>d[u][0]) {
                        d[e.t][1]=d[u][0];
                        q.push(A(-d[e.t][1], e.t, 1));
                    }
                }
            }
        }else {
            if(d[u][1]==-f.d) {
                clr[u][1]=1;
                
                for(i=0; i<g[u].size(); i++) {
                    Edge e=g[u][i];
                    if(clr[e.t][1]==0 && d[e.t][1]>d[u][1]+e.c) {
                        d[e.t][1]=d[u][1]+e.c;
                        q.push(A(-d[e.t][1], e.t, 1));
                    }
                }
                
            }
        }
    }
    
}


int main(void) {
    ll i, j;
    cin >> N >> M;
    
    for(i=0; i<M; i++) {
        ll a, b, c;
        cin >> a >> b >> c;
        a--; b--;
        g[a].pb(Edge(b, c));
        g[b].pb(Edge(a, c));
    }
    
    dijkstra(0);
    for(i=0; i<N; i++)
        pt(d[i][0]+d[i][1]);
    
}