# include <bits/stdc++.h>

using namespace std;

const int Nmax = 5 * 1e4 + 5, inf = INT_MAX;

int n, m, x, y, z, D[Nmax];

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

void dijkstra()
{   int cost, node;
    priority_queue < pair <int, int>, vector < pair <int, int> >, greater < pair <int, int> > > pq;

    for (int i = 1; i <= n; D[i] = inf, ++i);
    D[1] = 0, pq.push({0, 1});

    while (pq.size())
    {
        pair <int, int> X = pq.top();
        cost = X.first, node = X.second, pq.pop();

        if (cost != D[node]) continue;

        for (auto &it: G[node])
        {
            if (it.second + cost >= D[it.first]) continue;
            D[it.first] = it.second + cost;
            pq.push({D[it.first], it.first});
        }
    }
}


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

    scanf("%d %d\n", &n, &m);

    for (int i = 1; i <= n; ++i)
    {
        scanf("%d %d %d", &x, &y, &z);
        G[x].push_back({y, z});
    }

    dijkstra();

    for (int i = 2; i <= n; ++i)
        if (D[i] == inf) printf("0 ");
            else printf("%d ", D[i]);

    printf("\n");

    return 0;
}