#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

struct vecin
{
    int nod;
    int cost;
    vecin(int _nod, int _cost)
    {
        nod = _nod;
        cost = _cost;
    }
};
vector<vecin> vec[50005];
int viz[50005];
int n, m;
struct cmp
{
    bool operator()(int x, int y)
    {
        return viz[x] > viz[y];
    }
};

priority_queue<int, vector<int>, cmp > q;

void citire()
{
    int x, y, c;
    scanf("%d %d", &n, &m);
    for (int i = 0; i < n; i++)
    {
        scanf("%d %d %d", &x, &y, &c);
        vec[x].push_back(vecin(y, c));
    }
}

void dijkstra()
{
    q.push(1);
    int nod;
    while(!q.empty())
    {
        nod = q.top();
        q.pop();
        for (int i = 0; i < vec[nod].size(); i++)
        {
            int nouC = viz[nod] + vec[nod][i].cost;
            if (nouC < viz[vec[nod][i].nod] || viz[vec[nod][i].nod] == 0)
            {
                viz[vec[nod][i].nod] = nouC;
                q.push(vec[nod][i].nod);
            }
        }
    }
}

void afisare()
{
    for (int i = 2; i <= n; i++)
        printf("%d ", viz[i]);
}

int main()
{
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);

    citire();
    dijkstra();
    afisare();

    return 0;
}