#include <bits/stdc++.h>
using namespace std;

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

const int inf = INT_MAX;

int n, m;
vector<vector<pair<int, int>>> adj_list;

vector<int> dist, visited;

void read()
{
    fin >> n >> m;

    adj_list.assign(n + 1, {});
    dist.assign(n + 1, inf);
    visited.assign(n + 1, 0);

    for (int i = 0; i < m; i++)
    {
        int a, b, c;
        fin >> a >> b >> c;
        adj_list[a].push_back({c, b});
    }
}

void dijkstra()
{
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;

    pq.push({0, 1});
    visited[1] = 1;
    dist[1] = 0;

    while (!pq.empty())
    {
        auto [curr_cost, curr_x] = pq.top();
        pq.pop();

        for (auto &next : adj_list[curr_x])
        {
            auto [next_cost, next_x] = next;
            if (!visited[next_x] && dist[next_x] > dist[curr_x] + next_cost)
            {
                // relax edge
                dist[next_x] = dist[curr_x] + next_cost;
                visited[next_x] = 1;

                pq.push({dist[next_x], next_x});
            }
        }
    }
}

int main()
{
    read();
    dijkstra();

    for (int i = 2; i <= n; i++)
        fout << dist[i] << ' ';
    return 0;
}