#include <iostream>
#include <fstream>
#include <queue>
#include <vector>

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

const int NMax = 50005;
const int oo = ( 1<<30 );
int n, m;
int D[NMax];
bool InCoada[NMax];

vector < pair < int, int > > G[NMax];

struct ComparaDistante
{
    bool operator() (int x, int y)
    {
        return D[x] > D[y];
    }
};

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

void Citire()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int x,y,c;
        f >> x >> y >> c;
        G[x].push_back(make_pair(y,c));
    }
}

void Afisare()
{
    for(int i=2; i<=n; i++)
        if(D[i]!=oo)
            g<< D[i] <<" ";
        else
            g<<"0 ";
}

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;
        nodCurent= Coada.top();
        Coada.pop();
        InCoada[nodCurent]= false;

        for(size_t i=0; i<G[nodCurent].size(); i++)
        {
            int Vecin, Cost;
            Vecin=G[nodCurent][i].first;
            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;
                    }
                }
        }
    }
}

int main()
{
    Citire();
    Dijkstra(1);
    Afisare();
}