#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define pii pair<int, int>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
priority_queue<pii, vector<pii>, greater<pii>>pq;
int n, m, c, x, y;
int d[50005];
/**
by default perechile se ordoneaza dupa primul camp
(nod, cost) -> ordoneaza dupa cost;
-> in coada si implicit in graf memoram perechile invers, in forma (cost, nod)

*/
vector<pair<int, int>>g[50005];
int inf=10000005;
void dijkstra(int start){
    for(int i=1; i<=n; i++)
        d[i]=inf;
    d[start]=0;
    pq.push({0, start});
    while(!pq.empty()){
        int nod_curent=pq.top().second;
        pq.pop();
        for(auto x:g[nod_curent]){
            if(d[x.second]>d[nod_curent]+x.first){
                d[x.second]=d[nod_curent]+x.first;
                pq.push({d[x.second], x.second});
            }
        }
    }
}
int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y>>c;
        g[x].push_back({c,y});
    }
    dijkstra(1);
    for(int i=2; i<=n; i++){
        if(d[i]>=inf)
            fout<<0<<" ";
        else
        fout<<d[i]<<" ";
    }
    return 0;
}