#include "bits/stdc++.h"
// #include "grader.cpp"
#include "tree.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
#define mm make_pair
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 2e5+5;
vector<int> adj[N];
int w[N], sm[N], c[N], L, R, n;
void init(vector<int> p, vector<int> W){
n=(int)p.size();
for(int i = 0; i < n; ++i){
if(i>0)
adj[i].pb(p[i]), adj[p[i]].pb(i);
w[i]=W[i];
}
}
void dfs(int x, int pr){
sm[x]=c[x];
tr(it, adj[x])
if(*it!=pr){
dfs(*it, x);
sm[x]+=sm[*it];
}
if(sm[x]>R)
c[x]=sm[x]-R, sm[x]=R;
}
ll query(int L_, int R_){
L=L_, R=R_;
for(int i = 0; i < n; ++i){
sm[i]=0, c[i]=0;
if((int)adj[i].size()==1)
c[i]=L;
}
dfs(0, -1);
ll answer=accumulate(c, c+n, 0ll);
return answer;
}
