#include <bits/stdc++.h>

#define DIM 50005
#define INF 0x3f3f3f3f

using namespace std;

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

struct TNode {
    int node;
    int cost;

    bool operator <(const TNode node) const {
        return this->cost < node.cost;
    }
};

vector<TNode> edges[DIM];
int d[DIM];
set<TNode> dist;

void dijkstra() {
    while (!dist.empty()) {
        TNode node = *dist.begin();
        dist.erase(dist.begin());
        for (auto child: edges[node.node]) {
            if (d[child.node] >= d[node.node] + child.cost) {
                dist.erase({child.node, d[child.node]});
                d[child.node] = d[node.node] + child.cost;
                dist.insert({child.node, d[child.node]});
            }
        }
    }
}

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

    for (int i = 1; i <= n; i++) {
        d[i] = INF;
    }

    for (int i = 0; i < m; i++) {
        int x, y, cost;
        f >> x >> y >> cost;
        edges[x].push_back({y, cost});
    }

    d[1] = 0;
    dist.insert({1, 0});
    dijkstra();

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

    return 0;
}