#include <fstream>
#include <queue>
#include <algorithm>
#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;

priority_queue<pii, vector<pii>, greater<pii>> q;
vector<pii> v[MAXN];
int d[MAXN];
bool viz[MAXN];

int main() {

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


    viz[1] = 1;
    q.push(make_pair(0, 1));
    while (!q.empty()) {
        int cost = q.top().first;
        int node = q.top().second;
        for (int i = 0; i < v[node].size(); ++i) {
            int adjCost = v[node][i].first;
            int adjNode = v[node][i].second;
            if (viz[adjNode] == 0) {
                viz[adjNode] = 1;
                d[adjNode] = cost + adjCost;
                q.push(make_pair(cost + adjCost, adjNode));
            }
        }
        q.pop();
    }

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

    fout.close();
    return 0;
}