#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50005
#define oo (1<<30)
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector < pair <int,int> > G[NMAX];
int N,M;
bool InCoada[NMAX];
int D[NMAX];
struct cmpdst
{
    bool operator() (int x, int y)
    {
        return D[x]>D[y];
    }
};
priority_queue<int, vector <int>, cmpdst> Coada;
void Dijsktra(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 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 Afisare()
{
    for(int i = 2; i <= N; i++)
    {
        if(D[i] != oo)
            fout << D[i] << " ";
        else
            fout << "0 ";
    }
}
int main()
{
    Citire();
    Dijsktra(1);
    Afisare();
    return 0;
}