#include <bits/stdc++.h> #include "tree.h" using namespace std; using ll = long long; using pii = pair<int, int>; int n; std::vector<int> p, w; int k; void init(std::vector<int> P, std::vector<int> W) { p = P; w = W; n = (int)p.size(); vector<vector<int>> adj(n); for (int i=1; i<n; i++) { int a = i; int b = p[i]; adj[a].push_back(b); adj[b].push_back(a); } k=0; for (int i=0; i<n; i++) { if (adj[i].size()==1) k++; } } long long query(int L, int R) { return k*L+(max(0, k*L-R)); }