#include <fstream>
#include <vector>
#include <queue>

using namespace std;
using PII = pair<int, int>;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

static constexpr int nMAX = ((int)(5e4) + 4);
static constexpr int INF = ((int)(1e9));

int n;

vector<PII> G[nMAX];

auto cmp = [](const PII &a, const PII &b)
{
    if (!(a.first < b.first))
        return true;
    return false;
};
priority_queue<PII, vector<PII>, decltype(cmp)> H(cmp);

void add_edge(const int x, const int y, const int c)
{
    G[x].push_back({c, y});

    return;
}

void read()
{
    int m = 0;
    f >> n >> m;

    for (int e = 1; e <= m; ++e)
    {
        int x = 0, y = 0, c = 0;
        f >> x >> y >> c;

        add_edge(x, y, c);
    }

    return;
}

vector<int> dijkstra(const int S)
{
    vector<int> d((n + 1), INF);
    vector<bool> used((n + 1), false);

    d[S] = 0, used[S] = true;

    for (const PII &e : G[S])
        if (e.first < d[e.second])
            d[e.second] = e.first, H.push(e);

    while (!H.empty())
    {
        while (!H.empty() && used[H.top().second])
            H.pop();

        if (H.empty())
            break;

        int node = H.top().second;
        H.pop();

        used[node] = true;

        for (const PII &e : G[node])
            if (d[node] + e.first < d[e.second])
                if (!used[e.second])
                    d[e.second] = (d[node] + e.first), H.push({d[e.second], e.second});
    }

    return d;
}

int main()
{
    read();

    vector<int> distances = dijkstra(1);

    for (int i = 2; i <= n; ++i)
    {
        g << ((distances[i] == INF) ? 0 : distances[i]);

        if (i == n)
            g << '\n';
        else
            g << ' ';
    }

    return 0;
}