#include <fstream>
#include <vector>
#include <queue>
#define INF 0x3f3f3f
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int N, M;
vector<vector<pair<int, int>>> gr;
vector<int> d;
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
void read() {
    int a, b, c;
    fin >> N >> M;
    gr.resize(N + 1);
    d.resize(N + 1);
    for (int i = 0; i < M; ++i) {
        fin >> a >> b >> c;
        gr[a].emplace_back(b, c);
    }
}
void dijkstra(int nod) {
    for (int i = 1; i <= N; ++i) {
        d[i] = INF;
    }
    q.emplace(0, nod);
    pair<int, int> top;
    while (!q.empty()) {
        top = q.top();
        q.pop();
        if (d[top.second] == INF) {
            d[top.second] = top.first;
            for (auto i : gr[top.second]) {
                if (d[i.first] == INF) {
                    q.emplace(i.second + top.first, i.first);
                }
            }
        }
    }
}
int main()
{
    read();
    dijkstra(1);
    for (int i = 2; i <= N; ++i) {
        if (d[i] != INF) {
            fout << d[i] << " ";
        }
        else {
            fout << 0 << " ";
        }
    }
    return 0;
}