#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
vector<vector<pair<int, int>>> v;
vector<int> dist;
vector<int> dijkstra(int nod, vector<vector<pair<int, int>>> &edges)
{
    priority_queue<pair<int, int>> pq;
    vector<int> dist(edges.size(), -1);
    dist[nod] = 0;
    pq.push({0, nod});
    while (!pq.empty())
    {
        auto [dist_curr, node] = pq.top();
        pq.pop();
        dist_curr = -dist_curr;
        if (dist_curr != dist[node])
        {
            continue;
        }
        for (auto [nxt, cost] : edges[node])
        {
            if (dist[nxt] == -1 || dist[nxt] > dist[node] + cost)
            {
                dist[nxt] = dist[node] + cost;
                pq.push({-dist[nxt], nxt});
            }
        }
    }
    return dist;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int i, n, m, a, b, c;
    cin >> n >> m;
    v.resize(n + 1);
    for (i = 0; i < m; i++)
    {
        cin >> a >> b >> c;
        v[a].push_back({b, c});
    }
    dist = dijkstra(1, v);
    for (i = 2; i <= n; i++)
    {
        if(dist[i] == -1)
            cout << "0 ";
        else
            cout << dist[i] << " ";
    }
    return 0;
}