#include <bits/stdc++.h>
#define Nmax 50005
#define oo (1 << 31)-1
using namespace std;

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

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

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

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

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

void Citire()
{
    int x,y,c;
    fin >> N >> M;
    for (int i=1; i<=M; i++)
    {

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

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