#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define oo (1 << 31) - 1
#define Nmax 50005

using namespace std;

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

int N, M;
int D[Nmax];
bool inCoada[Nmax];

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

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

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

void citeste()
{
    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 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)
            g << D[i] << " ";
        else
            g << "0 ";
    }
}

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