#include "job.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=2e5+7;
vector<int>V[LIM];
ll dp[LIM], sumu[LIM], sumczas[LIM], n;
bool srt(pair<ll,ll>a, pair<ll,ll>b) {
return a.st*b.nd-a.nd*b.st<0;
}
void DFS(int x) {
ll a=sumczas[x];
vector<pair<ll,ll>>P;
for(auto i : V[x]) {
DFS(i);
P.pb({sumczas[i], sumu[i]});
sumu[x]+=sumu[i];
sumczas[x]+=sumczas[i];
dp[x]+=dp[i];
}
sort(P.begin(), P.end(), srt);
ll akt=0;
for(int i=P.size()-1; i>=0; --i) {
dp[x]+=P[i].nd*akt;
akt+=P[i].st;
}
dp[x]+=a*sumu[x];
}
ll scheduling_cost(vector<int>P, vector<int>U, vector<int>D) {
n=P.size();
rep(i, n-1) V[P[i+1]].pb(i+1);
rep(i, n) {
sumu[i]=U[i];
sumczas[i]=D[i];
}
DFS(0);
return dp[0];
}
