#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];
int d[MAXN];
bool viz[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});
    }

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

    q.push({0, 1});
    d[1] = 0;

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

    for (int i = 2; i <= n; ++i) {
        if (d[i] == INT_MAX) {
            fout << '0' << ' ';
        }
        else {
            fout << d[i] << ' ';
        }
    }



    fout.close();
    return 0;
}