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

const int N = 1e5 + 5;
vector<pair<int,long long>> adj[N];
long long dist[N];
bool vis[N];
int n;

void dijkstra (int source) {
    for (int i = 1; i <= n; i++)
        dist[i] = LLONG_MAX, vis[i] = 0;

    priority_queue<pair<long long,int>> pq;
    pq.emplace(0, source);
    dist[source] = 0;

    while (pq.size()) {
        int u = pq.top().second;
        if (vis[u]) continue;
        vis[u] = 1;
        for (pair<int,long long> it : adj[u]) {
            int v; long long w; tie(v, w) = it;
            if (dist[u] + w < dist[v]) {
                dist[v] = dist[u] + w;
                pq.emplace(-dist[v], v);
            }
        }
    }
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int m; cin >> n >> m;
    while (m--) {
        int a, b, c; cin >> a >> b >> c;
        adj[a].emplace_back(b, c);
    }
    dijkstra(1);

    for (int i = 1; i <= n; i++) cout << dist[i] << " ";

    return 0;
}