#include <fstream>
#include <vector>
#include <iostream>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");


const int NMax=100005;
int N,M,D[NMax],S[NMax];
const int oo=2000000000;
vector < pair <int,int> >G[NMax];

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

        }
        fout<<"\n";
    }

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()
{
    for(int i=1; i<=N; ++i)
        D[i]=oo;
    D[1]=0;
    for(int k=1; k<=N; ++k)
    {
        int Min=oo, Nod;
        for (int i=1;i<=N;++i)
        {
            if(D[i]<Min && S[i]==0)
            {
                Min=D[i];
                Nod=i;
            }
            S[Nod]=1;
        }
        for(int i=0;i<(int)G[Nod].size();++i)
        {
            int Vecin=G[Nod][i].first,Cost=G[Nod][i].second;
            D[Vecin]=min(D[Vecin],D[Nod]+Cost);
        }
    }
}



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