#include <bits/stdc++.h>
#define Nmax 50000
#define Mmax 250000
#define oo (1<<30)
using namespace std;

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

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

vector< pair<int,int> > g[Nmax];
priority_queue<int,vector<int>,compare> Coada;

void Read()
{
    ifstream f("dijkstra.in");
    f>>n>>m;
    int x,y,c;
    for(int i=1;i<=n;i++)
    {
        f>>x>>y>>c;
        g[x].push_back(make_pair(y,c));
    }
    f.close();
}

void Afisare()
{
    ofstream g("dijkstra.out");
    for(int i=2;i<=n;i++)
        if(d[i] != oo)
            g<<d[i]<<" ";
        else
            g<<"0"<<" ";
}

void Dijkstra(int nodStart)
{
    for(int i=1;i<=n;i++)
        d[i]=oo;

    d[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(d[nodCurent] + cost < d[vecin])
            {
                d[vecin] = d[nodCurent] + cost;

                if(!InCoada[vecin])
                {
                    Coada.push(vecin);
                    InCoada[vecin]=true;
                }
            }
        }
    }

}
int main()
{
    Read();
    Dijkstra(1);
    Afisare();
    return 0;
}