#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <limits.h>

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n,m,D[50005],viz[50005];

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

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

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

void citire_graf()
{
    f>>n>>m;
    for(int i=1;i<=m;++i)
    {
        int x,y,c;
        f>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
    }
}

void dijkstra(int nod)
{
    for(int i=1;i<=n;++i)
        D[i]=INT_MAX;
    D[nod]=0;
    Coada.push(nod);
    viz[nod]=1;
    while(!Coada.empty())
    {
        int nod_curent=Coada.top();
        Coada.pop();
        viz[i]=0;
        for(int i=0;i<G[nod_curent].size();++i)
        {
            int vecin=G[nod_curent][i].first;
            int cost=G[nod_curent][i].second;
            if(D[nod_curent]+cost<D[vecin])
            {
                D[vecin]=D[nod_curent]+cost;
                if(!viz[vecin])
                {
                    Coada.push(vecin);
                    viz[vecin]=1;
                }
            }
        }
    }
}

void afisare()
{
    for(int i=2;i<=n;++i)
    {
        if(D[i]==INT_MAX) g<<"0 ";
        else g<<D[i]<<' ';
    }
}

int main()
{
    citire_graf();
    dijkstra(1);
    afisare();
    return 0;
}