#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>.
#include <vector>
#include <queue>
#include <tuple>

using namespace std;


ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

using VI = vector<int>;
using VVI = vector<VI>;
using VPI = vector<pair<int, int>>;
using VVPI = vector<VPI>;


const int INF = (1 << 30);

int n, m;
vector<bool> viz;
VI d;
VVPI G;


void Dijkstra(int x)
{
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> Q;
    Q.emplace(0, x);
    d[1] = 0;

    int w;

    while (!Q.empty())
    {
        tie(w, x) = Q.top();
        Q.pop();

        if (viz[x])
            continue;

        viz[x] = true;

        for (auto y : G[x])
        {
            if (d[y.second] > y.first + w)
            {
                d[y.second] = y.first + w;
                Q.emplace(d[y.second], y.second);
            }
        }
    }
}

int main()
{
    fin >> n >> m;
    G = VVPI(n + 1);

    int x, y, w;
    for (int i = 1; i <= m; ++i)
    {
        fin >> x >> y >> w;
        G[x].emplace_back(w, y);
    }

    viz = vector<bool>(n + 1);
    d = VI(n + 1, INF);
    Dijkstra(1);

    for (int i = 2; i <= n; ++i)
        if (d[i] != INF)
            fout << d[i] << ' ';
        else
            fout << 0 << ' ';

}