#include <fstream>
#include <queue>
#include <vector>
#define Nmax 50005
#define INF 1 << 30

using namespace std;

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

int n, m;
int folosit[Nmax];
bool InCoada[Nmax];

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

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

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

void Citeste()
{
    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 nodStart)
{
    for(int i = 1; i <= n; i++)
        folosit[i] = INF;

    folosit[nodStart]=0;

    Coada.push(nodStart);
    InCoada[nodStart] = true;

    while(!Coada.empty())
    {
        int nodCurent = Coada.top();
        Coada.pop();

        InCoada[nodCurent] = false;
        for(size_t i = 0; i < G[nodCurent].size(); i++)
        {
            int Vecin = G[nodCurent][i].first;
            int Cost = G[nodCurent][i].second;
            if(folosit[nodCurent] + Cost < folosit[Vecin])
            {
                folosit[Vecin] = folosit[nodCurent] + Cost;
                if(InCoada[Vecin] == false)
                {
                    Coada.push(Vecin);
                    InCoada[Vecin] = true;
                }
            }
        }
    }
}

void Afiseaza()
{
    for(int i = 2; i <= n; i++)
    {
        if(folosit[i] != INF)
            g << folosit[i] << " ";
        else
            g << "0 ";
    }
}

int main()
{
    Citeste();
    dijkstra(1);
    Afiseaza();
}