#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

#define NMax 50005
#define oo (1 << 30)

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

int N, 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 Read()
{
    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 Dijkstra(int nod_start)
{
    for(int i = 1; i <= N; i++)
        D[i] = oo;

    D[nod_start] = 0;
    Coada.push(nod_start);
    InCoada[nod_start] = true;
    while(!Coada.empty())
    {
        int nodCurent = Coada.top();
        Coada.pop();
        InCoada[nodCurent] = false;
        for(unsigned int 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 Print()
{
    for(int i = 2; i <= N; i++)
        if(D[i] != oo)
            fout << D[i] << " ";
        else
            fout << 0 << " ";
}
int main()
{
    Read();
    Dijkstra(1);
    Print();
}