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

struct per
{
    int dy,cost;
};

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

const int oo=2000000005;
int n,m;
bool inCoada[50005];
vector < per > a[50005];
priority_queue < int , vector < int > , compara > coada;

void citire()
{
    int x,y,c;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        per pertmp;
        pertmp.dy=y;
        pertmp.cost=c;
        a[x].push_back(pertmp);
    }
}

void afisare()
{
    for(int i=2;i<=n;i++)
        if(d[i]!=oo) fout<<d[i]<<' ';
        else fout<<'0';

}

void dijkstra(int nodStart)
{
    int nodCurent,vecin,costul;
    for(int i=1;i<=n;i++)
        d[i]=oo;
    d[nodStart]=0;
    coada.push(nodStart);
    inCoada[nodStart]=true;
    while(!coada.empty())
    {
        nodCurent=coada.top();
        coada.pop();
        inCoada[nodCurent]=false;
        for(unsigned int i=0;i<a[nodCurent].size();i++)
        {
            vecin=a[nodCurent][i].dy;
            costul=a[nodCurent][i].cost;
            if(d[nodCurent]+costul<d[vecin])
            {
                d[vecin]=d[nodCurent]+costul;
                if(inCoada[vecin]==false)
                {
                    coada.push(vecin);
                    inCoada[vecin]=true;
                }
            }
        }
    }
}

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