#include <fstream>
#include <vector>
#define NMax 50005
#define oo 100000000
using namespace std;

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

int N,M;
vector < pair <int,int> > G[NMax];
int D[NMax],S[NMax];

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 Solve()
{
    for(int i=2;i<=N;i++)
        D[i]=oo;
    for(int i=2;i<=N;i++)
    {
        int Min=oo, Nod;
        for(int j = 1; j<=N ; j++)
            if(Min > D[j] && !S[j])
                {
                    Min = D[j];
                    Nod = j;
                }
    S[Nod] = 1;

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

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();
    Solve();
    Print();
    return 0;
}