#include <vector>
#include <fstream>
#include <algorithm>
#include <queue>
#define inf 1000001
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int NMax = 50005;
int n,m,d[NMax];
bool ok[NMax];
vector < pair <int, int> > G[NMax];
struct compara
{
    bool operator()(int x, int y)
    {
        return d[x] > d[y];
    }
};
priority_queue<int, vector<int>, compara> coada;
void citire()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        int x, y, c;
        fin >> x >> y >> c;
        G[x].push_back(make_pair(y, c));
    }
}
void dijkstra(int start)
{
    for (int i = 1; i <= n; i++)
        d[i] = inf;
    d[start] = 0;
    coada.push(start);
    ok[start] = true;
    while (!coada.empty())
    {
        int nodCurent = coada.top();
        coada.pop();
        ok[nodCurent] = false;
        for (size_t i = 0; i < G[nodCurent].size(); i++)
        {
            int nodViitor = G[nodCurent][i].first;
            int Cost = G[nodCurent][i].second;
            if (d[nodCurent] + Cost < d[nodViitor])
            {
                d[nodViitor] = d[nodCurent] + Cost;
                if (ok[nodViitor] == false)
                {
                    coada.push(nodViitor);
                    ok[nodViitor] = true;
                }
            }
        }
    }
}
void afi()
{
    for (int i = 2; i <= n; i++)
    {
        if (d[i] != inf)
            fout << d[i] << " ";
        else
            fout << "0";
    }
}
int main()
{
    citire();
    dijkstra(1);
    afi();
}