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

const int NMAX = 5e4 + 5, INF = 1e9 + 7;
int n, m, dist[NMAX];
vector<pair<int, int>> v[NMAX];

int main() {
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);

    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        v[a].push_back({b, c});
    }

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

    dist[1] = 0;
    priority_queue <pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
    q.push({0, 1});

    while(!q.empty()) {
        int node = q.top().second;
        int val = q.top().first;
        q.pop();

        for(auto u : v[node]) {
            if(val + u.second > dist[u.first])
                continue;
            dist[u.first] = val + u.second;
            q.push({val + u.second, u.first});
        }
    }

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