#include <iostream>
#include <vector>
#include <queue>
using namespace std;
const int maxn = 1e5 + 10;
const int INF = 2e9;
vector<pair<int, int>> graph[maxn];
int n, m;
struct node {
    int idx, cost;
    node () {}
    node(int _idx, int _cost) {
        idx = _idx;
        cost = _cost;
    }
    bool operator < (const node &tmp) const {
        return cost > tmp.cost;
    }
};

void dijkstra(int start_node) {
    vector<int> distance(n, INF);
    vector<bool> visited(n, false);

    distance[start_node] = 0;
    priority_queue<node> pq;
    pq.push(node(start_node, 0));

    while(!pq.empty()) {
        node c = pq.top();
        pq.pop();

        if(visited[c.idx]) {
            continue;
        }
        visited[c.idx] = true;

        for(int i = 0; i < (int) graph[c.idx].size(); i++) {
            int neighbour = graph[c.idx][i].first;
            int weight = graph[c.idx][i].second;

            if(!visited[neighbour] and c.cost + weight < distance[neighbour]) {
                pq.push(node(neighbour, c.cost + weight));
                distance[neighbour] = c.cost + weight;
            }

        }
    }

    for(int i = 0; i < n; i++) {
        cout << distance[i] << " ";
    }
}
int main() {
    cin >> n >> m;
    for(int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        graph[a].push_back(make_pair(b, c));
        graph[b].push_back(make_pair(a, c));
    }
    dijkstra(0);

    return 0;
}