// divetimp.cpp : This file contains the 'main' function. Program execution begins and ends there.
//

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

using namespace std;

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

const int NMax = 50005;
const int oo = (1<<31)-1;

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 citeste()
{
    fin>>N>>M;
    for(int i=1;i<=M;i++)
    {

        int x,y,c;
        fin>>x>>y>>c;
        G[x].push_back({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 afiseaza()
{
    for(int i=2;i<=N;i++)
    {
        if(D[i]!=oo)
            fout<<D[i]<<" ";
        else
            fout<<"0 ";
    }
}

int main()
{
    citeste();
    dijkstra(1);
    afiseaza();
    return 0;
}