// ~ Be Name Khoda ~ //
#include "friend.h"
#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,Ofast")
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define fi first
#define se second
const int maxn = 1e6 + 10;
const int maxn5 = 5e5 + 10;
const int maxnt = 1.2e6 + 10;
const int maxn3 = 1e3 + 10;
const int mod = 1e9 + 7;
const ll inf = 1e18;
int cmp[maxn5];
// Find out best sample
int findSample(int n,int confidence[], int host[], int protocol[]){
ll ans[2] = {0, 0};
cmp[0] = 0;
ans[0] = confidence[0];
for(int i = 1; i < n; i++){
cmp[i] = cmp[host[i]] ^ (protocol[i]) ^ 1;
ans[cmp[i]] += confidence[i];
}
return max(ans[0], ans[1]);
}
