#include <bits/stdc++.h>
#include <queue>
using namespace std;
#define ll long long

void mincammino(int n, int m, vector<int> x, vector<int> y, vector<int> p, vector<long long>& D) {
    // n nodes
    // m ed
    // x root y next m weight

    vector<vector<pair<int,int>>> adj(n);
    for (int i = 0; i < m; i++) {
        adj[x[i]].push_back({y[i], p[i]});
    }

    vector<ll> d(n, LLONG_MAX);
    d[0] = 0;
    priority_queue<pair<ll,int>, vector<pair<ll,int>>, greater<>> q;
    q.push({0, 0});

    while (!q.empty()) {
        auto [v, root] = q.top(); q.pop();
        if (d[root] < v) continue;
        d[root] = v;

        for (auto [next, c] : adj[root]) {
            if (d[next] > v+c) {
                d[next] = v+c;
                q.push({v+c, next});
            }
        }
    }

    for (int i = 0; i < n; i++) if (d[i] == LLONG_MAX) d[i] = -1;
    D = d;
}