#include <bits/stdc++.h>
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, -1);
    queue<pair<int,ll>> q;
    q.push({0, 0});

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

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

    D = d;
}