#include <fstream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <climits>
#include <set>
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];
set<pair<int, int>> s;

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;
    }

    s.insert({0, 1});
    d[1] = 0;

    while (!s.empty()) {
        pair<int, int> t = *s.begin();
        int node = t.second;
        int cost = t.first;
        s.erase(s.begin());
        if (viz[node] == 0) {
            viz[node] = 1;
            for (int i = 0; i < v[node].size(); ++i) {
                int k = v[node][i].second;
                int c = v[node][i].first;
                if (d[k] > d[node] + c) {
                    d[k] = d[node] + c;
                    s.insert({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;
}