#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

const int INF=1e9;
int n, m, i, a, b, cost;
vector<pair<int, int>> v[50005];
int dist[50005];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;

int main()
{
    fin>>n>>m;

    for(i=1;i<=m;i++){
        fin>>a>>b>>cost;

        v[a].push_back({cost, b});
    }

    for(i=2;i<=n;i++){
        dist[i]=INF;
    }

    pq.push({0, 1});
    while(!pq.empty()){
        int cost=pq.top().first;
        int nod=pq.top().second;

        pq.pop();

        if(cost>dist[nod]){
            continue;
        }

        for(i=0;i<v[nod].size();i++){
            if(cost+v[nod][i].first<dist[v[nod][i].second]){
                dist[v[nod][i].second]=cost+v[nod][i].first;
                pq.push({dist[v[nod][i].second], v[nod][i].second});
            }
        }
    }

    for(i=2;i<=n;i++){
        if(dist[i]==INF)
            dist[i]=0;
        fout<<dist[i]<<" ";
    }




    return 0;
}