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

using namespace std;

#define NMAX 50001



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

int D[NMAX];
vector < pair <int,int> > GMAX[NMAX];
struct compara
{
    bool operator()(int x, int y)
    {
        return D[x] > D[y];
    }
};
priority_queue<int, vector<int>, compara> Coada;
bool EsteInCoada[NMAX];
int M,N;
const int inf = (1 << 30);
void Citire()
{

    int X,Y,COST;
    fin>>N>>M;
    for(int i = 1 ; i <= M; i++)
    {
        fin>>X>>Y>>COST;
        GMAX[X].push_back(make_pair(Y,COST));
    }
    for(int i = 1 ; i <= N ; i++)
        D[i] = inf;
}

void DIJKSTRA(int nodStart)
{


    D[nodStart] = 0;
    Coada.push(nodStart);
    EsteInCoada[nodStart] = true;
    while(!Coada.empty())
    {
        int nodCurent = Coada.top();
        Coada.pop();
        EsteInCoada[nodCurent] = false;
        for(int i = 0; i <(int)GMAX[nodCurent].size(); i++)
        {
            int vecin = (int)GMAX[nodCurent][i].first;
            int cost = (int)GMAX[nodCurent][i].second;

            if(D[nodCurent] + cost < D[vecin])
            {
                D[vecin] = D[nodCurent] + cost;
                if(!EsteInCoada[vecin]){
                Coada.push(vecin);
                EsteInCoada[vecin] = true;}
            }
        }
    }
}
void Scriere()
{
    for(int i = 2 ; i <= N; i++)
        if(D[i] != inf)
            fout << D[i]<< " ";
        else
            fout<< "0 ";
}
int main()
{
    Citire();
    DIJKSTRA(1);
    Scriere();
    return 0;
}