#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define NMAX 50005
using namespace std;
const int oo = (1 << 30);
int D[NMAX],n,m;
bool InCoada[NMAX];
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector < pair <int,int> > G[NMAX];
struct compare{
    bool operator()(int x,int y){
        return D[x]>D[y];
    }
};
priority_queue <int , vector<int>,compare> Coada;
void Citire(){
    fin>>n>>m;
    for(int i=1;i<=m;i++){
        int x,y,c;
        fin>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
    }
}
void Dijkstra(int nodStart){
    for(int i=1;i<=n;i++)
        D[i]=oo;
    D[nodStart]=0;
    Coada.push(nodStart);
    InCoada[nodStart]=true;
    while(!Coada.empty()){
        int nodCurent = Coada.top();
        Coada.pop();
        InCoada[nodCurent]=false;
        for(size_t i=0;i<G[nodCurent].size();i++){
            int vecin = G[nodCurent][i].first;
            int cost = G[nodCurent][i].second;
            if(D[nodCurent]+cost<D[vecin]){
                D[vecin]=D[nodCurent]+cost;
                if(InCoada[vecin]==false){
                    Coada.push(vecin);
                    InCoada[vecin]=true;
                }
            }
        }

    }
}
void Afisare(){
    for(int i=2;i<=n;i++){
        if(D[i]!=oo)fout<<D[i]<<" ";
        else
            fout<<"0 ";
    }
}
int main()
{
    Citire();
    Dijkstra(1);
    Afisare();
    return 0;
}