#include <fstream>
#include <vector>
using namespace std;

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

const int NMax = 50005;
const int oo = 1<<30;
int N,M;
int D[NMax],S[NMax];
vector<pair <int,int> > G[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 Dijkstra()
{
    for(int i = 2; 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])
                    {
                        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);
                }
        }
}

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

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