#include <fstream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <climits>
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

const int MAXN = 50005;
int n, m;
vector<pair<int, int>> v[MAXN];
priority_queue <pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
int cs[MAXN];

int main() {

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

    for (int i = 1; i <= n; ++i) {
        cs[i] = INT_MAX;
    }

    q.push({1, 0});

    while(!q.empty()) {
        int k = q.top().first;
        int cost = q.top().second;
        q.pop();
        for (int i = 0; i < v[k].size(); ++i) {
            if (cs[v[k][i].first] > cost + v[k][i].second) {
                cs[v[k][i].first] = cost + v[k][i].second;
                q.push({v[k][i].first, cost + v[k][i].second});
            }
        }
    }

    for (int i = 2; i <= n; ++i) {
        fout << cs[i] << ' ';
    }

    fout.close();
    return 0;
}