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

const int NMax = 50005;
const int oo = 0x3f3f3f3f;

unsigned short int N;
int 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 citeste()
{
    fin>>N>>M;
    for(int i=1; i<=M; i++)
    {
        unsigned short int x,y,c;
        fin>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
    }
}

void Dijkstra(int nodStart)
{
    for(register unsigned short int i=1; i<=N; i++)
        D[i]=oo;

    D[nodStart]=0;

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

    while(!Coada.empty())
    {
        register unsigned short 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;
                }
            }
        }
    }
}
void Afiseaza()
{
    for(register unsigned short int i=2; i<=N; i++)
        if(D[i]!=oo)
            fout << D[i] << " ";
        else
            fout << "0 ";
}
int main()
{
    citeste();
    Dijkstra(1);
    Afiseaza();
    return 0;
}