#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <algorithm>
#define NMax 50005
#define oo 1<<30
using namespace std;

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


int N,M;
int D[NMax];
bool InCoada[NMax];
vector <pair < int,int> > G[NMax];
struct compara
{
    bool operator()(int x,int y){
        return D[x]>D[y];
    }
};

priority_queue <int,vector <int> , compara > Coada;

void Dijkstra(int nodStart){
    fin>>N>>M;
    for(register int i=1;i<=M;i++){
        register int x,y,c;
        fin>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
    }

    for(register int i=1;i<=N;i++)
        D[i]=oo;

    D[nodStart]=0;

    Coada.push(nodStart);
    InCoada[nodStart]=true;

    while(!Coada.empty())
        {
        register int nodCurent = Coada.top();
        Coada.pop();

        InCoada[nodCurent]=false;
        for(size_t i=0;i<G[nodCurent].size();i++)
        {
                register int Vecin= G[nodCurent][i].first;
                register int Cost= G[nodCurent][i].second;
                if(D[nodCurent]+Cost < D[Vecin])
                {
                    D[Vecin]=D[nodCurent]+Cost;
                    if(!InCoada[Vecin])
                    {
                        Coada.push(Vecin);
                        InCoada[Vecin]=false;
                    }
                }
        }
    }
    for(register int i=2;i<=N;i++)
        if(D[i]!=oo)
            fout << D[i] << " ";
        else
            fout << "0 ";
}
int main(){
    Dijkstra(1);
}