#include <bits/stdc++.h>
using namespace std;

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

const int INF = 1000000000;

int n, m;
vector<pair<int,int>> graf[50001];   // lista de adiacenta
int d[50001];
int F[50001]; // vizitat

int minDistanta()
{
    int minim = INF;
    int min_index = -1;

    for (int i = 1; i <= n; i++) {
        if (!F[i] && d[i] < minim) {
            minim = d[i];
            min_index = i;
        }
    }
    return min_index;
}

void afisare()
{
    for (int i = 2; i <= n; i++) {
        if (d[i] == INF) out << 0 << " ";
        else out << d[i] << " ";
    }
}

void dijkstra(int s)
{
    for (int i = 1; i <= n; i++) {
        d[i] = INF;
        F[i] = 0;
    }

    d[s] = 0;

    for (int i = 1; i <= n; i++) {

        int u = minDistanta();
        if (u == -1) break;

        F[u] = 1;

        for (auto &edge : graf[u]) {
            int v = edge.first;
            int cost = edge.second;

            if (!F[v] && d[u] + cost < d[v]) {
                d[v] = d[u] + cost;
            }
        }
    }

    afisare();
}

int main()
{
    in >> n >> m;

    int x, y, c;
    for (int i = 0; i < m; i++) {
        in >> x >> y >> c;
        graf[x].push_back({y, c});
    }

    dijkstra(1);

    return 0;
}