#include <bits/stdc++.h>
#define ll long long
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

const ll inf = 1e17;

ll N,M,i,j,F[50005],d[50005],a,b,c;

vector< pair<ll,ll> > A[50005];

priority_queue< pair<ll,ll> > pq;

int main()
{
    fin >> N >> M;

    for (i = 1;i <= M;i++){
        fin >> a >> b >> c;
        A[a].push_back({b,c});
    }

    for (i = 2;i <= N;i++)
        d[i] = inf;
        
    pq.push({0,1});

    while (!pq.empty()){
        b = pq.top().second;
        pq.pop();

        if (F[b] == 1)
            continue;
        F[b] = 1;
        
        for (auto nextn : A[b]){
            if (d[nextn.first] > d[b] + nextn.second){
                d[nextn.first] = d[b] + nextn.second;
                pq.push({-d[nextn.first],nextn.first});
            }
        }
    }

    for (i = 2;i <= N;i++)
        if (d[i] == inf)
            fout << "0 ";
        else
            fout << d[i] << " ";

    return 0;
}