#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define MAX_VALUE 999999999
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n, m, x, y, z;
vector <vector <pair <int, int> > > vertex;
vector <int> d;
struct comp {
    bool operator() (pair <int, int> &a, pair <int, int> &b) {
        return a.second < b.second;
    }
};
priority_queue <pair<int, int>, vector <pair <int, int> >, comp> prq;
int main()
{
    fin>>n>>m;
    vertex.resize(n + 1);
    d.resize(n + 1, MAX_VALUE);
    for (int i = 1; i <= m; i++) {
        fin>>x>>y>>z;
        vertex[x].push_back(make_pair(y, z));
    }
    int k = 1, dist = 0;
    d[k] = 0;
    prq.push(make_pair(k, dist));
    while (!prq.empty()) {
        k = prq.top().first;
        dist = prq.top().second;
        prq.pop();
        if (dist > d[k])
            continue;
        for (int i = 0; i < vertex[k].size(); i++) {
            if (dist + vertex[k][i].second < d[vertex[k][i].first]) {
                d[vertex[k][i].first] = dist + vertex[k][i].second;
                prq.push(make_pair(vertex[k][i].first, vertex[k][i].second));
            }
        }
    }
    for (int i = 2; i <= n; i++) {
        if(d[i]!=MAX_VALUE)
        fout<<d[i]<<' ';
        else
        fout<<"0 ";
    }
    fin.close();
    fout.close();
    return 0;
}