#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

const int lim=50001;
const int oo=(1<<30);
int N,M, d[lim];
bool incoada[lim];

vector < pair <int,int> > g[lim];

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

priority_queue<int, vector<int>, compD> coada;

void citeste ()
{
    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 (int nods)
{
    for (int i=1; i<=N; i++)
        d[i]=oo;
    d[nods]=0;
    coada.push(nods);
    incoada[nods]=true;
    while(!coada.empty())
    {
        int nodcurent=coada.top();
        coada.pop();
        incoada[nodcurent]=false;
        for (unsigned i=0; i<g[nodcurent].size(); i++)
        {
            int vecin = g[nodcurent][i].first;
            int cost=g[nodcurent][i].second;
            if (d[nodcurent]+cost<d[vecin])
            {
                d[vecin]=d[nodcurent]+cost;
                if (incoada[vecin]==false)
                {
                    coada.push(vecin);
                    incoada[vecin]=true;
                }
            }
        }
    }

}

void afiseaza ()
{
    for (int i=2; i<=N; i++)
    {
        if (d[i]!=oo)
            fout<<d[i]<<" ";
        else
            fout<<"0 ";
    }
}

int main()
{
    citeste();
    dijkstra(1);
    afiseaza();
    return 0;
}