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


using namespace std;

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

const int oo= (1 << 30);
int drum[50005],n,m;
vector < pair <int,int> > G[50005];

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

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

bool incoada[50005];

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

void afisare()
{
    for(int i=2;i<=n;i++)
        if(drum[i]!=oo)
            g<<drum[i]<< " ";
        else
            g<<"0 ";
}

void djikstra(int start)
{
    int nodcurent;
    for(int i=2;i<=n;i++)
        drum[i]=oo;
    coada.push(start);
    incoada[start]=true;

    while(!coada.empty())
    {
        nodcurent=coada.top();
        coada.pop();
        incoada[nodcurent]=false;
        for(size_t i=0;i<G[nodcurent].size();i++)
        {
            if(drum[nodcurent] + G[nodcurent][i].second < drum[G[nodcurent][i].first])
            {
                drum[G[nodcurent][i].first]=drum[nodcurent] + G[nodcurent][i].second;
                if(!incoada[G[nodcurent][i].first])
                {
                    coada.push(G[nodcurent][i].first);
                    incoada[G[nodcurent][i].first]=true;
                }
            }
        }
    }
}

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