#include <fstream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>

#define pii pair<int, int>
using namespace std;

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

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

int main() {

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

    q.push({0, 1});

    while (!q.empty()) {
        int k = q.top().second;
        int c = q.top().first;
        if (viz[k] == 0) {
            viz[k] = 1;
            s[k] = c;
            for (int i = 0; i < v[k].size(); ++i) {
                int node = v[k][i].second;
                if (viz[node] == 0 || s[node] > c + v[k][i].first) {
                    q.push({c + v[k][i].first, node});
                }
            }
        }
        q.pop();
    }

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

    fout.close();
    return 0;
}