#include <fstream>
#include <vector>
#include <queue>
#define MAX 1e9

using namespace std;

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

int n, m;

priority_queue < pair <int, int>, vector <pair <int, int> >, greater <pair <int, int> > > q;

vector <vector <pair <int, int> > > a;

vector <bool> viz;

vector <int> cost;

void dijkstra()
{
    cost[1]  = 0;

    q.push({0, 1});

    while (!q.empty()) {
        pair <int, int> nod = q.top();

        q.pop();

        for (const auto &vecin : a[nod.second]) {
            if (nod.first + vecin.second < cost[vecin.first]) {
                cost[vecin.first] = nod.first + vecin.second;
                q.push({cost[vecin.first], vecin.first});
            }
        }
    }
}

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

    a.resize(n + 5), cost.resize(n + 5, (MAX)), viz.resize(n + 5, 0);

    for (int i = 1; i <= m; ++i) {
        int x, y, z;

        f >> x >> y >> z;

        a[x].push_back({y, z});
        a[y].push_back({x, z});
    }

    dijkstra();

    for (int i = 2; i <= n; ++i) {
        if (cost[i] == MAX) {
            cost[i] = 0;
        }

        g << cost[i] << ' ';
    }

    return 0;
}