#include <fstream>
#include <vector>
#define NMax 50005
#define oo 1000000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int N,M;
vector <pair <int,int> > G[NMax];
int D[NMax];
int Heap[NMax],Poz[NMax],NHeap;

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 Swap(int i, int j)
{
    swap(Heap[i], Heap[j]);
    swap(Poz[Heap[i]], Poz[Heap[j]]);
}

void DownHeap(int Pos)
{
    int Son = 2*Pos;

    if (Son+1<=NHeap && D[ Heap[Son+1] ]<D[ Heap[Son] ])
        Son++;
    if( Son<=NHeap && D[Heap[Son]] < D[Heap[Pos]])
        {
            Swap(Son,Pos);
            DownHeap(Son);
        }
}

void UpHeap(int Pos)
{
    int Father = Pos / 2;

    if(Father && D[ Heap[Pos] ] < D[ Heap[Father] ])
        {
            Swap(Father,Pos);
            UpHeap(Father);
        }
}

void Dijkstra()
{
    for(int i=2;i<=N;i++)
        D[i] = oo;

    for(int i=1;i<=N;i++)
        {
            Heap[i] = i;
             Poz[i] = i;
        }

   NHeap = N;

   for(int i = 1;i <= N; i++)
    {
        int Nod = Heap[1];
        Swap(1,NHeap);
        NHeap--;
        DownHeap(1);

        for(int j=0;j<(int)G[Nod].size();j++)
            {
                int Vecin = G[Nod][j].first,Cost = G[Nod][j].second;
                if ( D[Nod]+Cost < D[Vecin] )
                {
                    D[Vecin] = D[Nod]+Cost;

                    UpHeap(Poz[Vecin]);
                }
            }
    }
}

void Print()
{
    for(int i=2;i<=N;i++)
        if(D[i]==oo)
            D[i]=0;
    for(int i=2;i<=N;i++)
        fout<<D[i]<<" ";
    fout<<"\n";
}

int main()
{
    Read();
    Dijkstra();
    Print();
    return 0;
}