#include <iostream>
#include <queue>
#include <vector>
#include <utility>
using namespace std;
using ll = long long;
using Graph = vector<vector<pair<int, ll>>>;
using pli = pair<ll, int>;

const ll INF = 1LL<<50;

int N, M;

Graph G(100010);
ll D[200010];

void Dijkstra(int src){
    fill(&D[0], &D[0]+200010, INF);
    D[src]=0; D[src+N]=0;
    priority_queue<pli, vector<pli>, greater<pli>> Q;
    Q.push({0, src});
    Q.push({0, src+N});

    while(! Q.empty()){
        auto [dist, cur] = Q.top();
        Q.pop();

        if(dist>D[cur]) continue;
        if (cur>N){
            for (auto [dst, d]: G[cur-N]){
                if (dist+d<D[dst+N]){
                    Q.push({D[dst+N]=dist+d, dst+N});
                }
            }
        }
        else{
            for (auto [dst, d]: G[cur]){
                if (dist+d<D[dst]){
                    Q.push({D[dst]=dist+d, dst});
                }
                if (dist<D[dst+N]){
                    Q.push({D[dst+N]=dist, dst+N});
                }
            }
        }
    }
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    scanf("%d %d", &N, &M);

    for (int i=0;i<M;i++){
        int A, B; ll C;
        scanf("%d %d %lld", &A, &B, &C);
        G[A].push_back({B, C});
        G[B].push_back({A, C});
    }
    Dijkstra(1);
    for (int i=1;i<=N;i++){
        printf("%lld\n", D[i]+D[i+N]);
    }
    return 0;
}