#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<int,int>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
vector<vll>adj;
ll arr[1005];
int findSample(int n, int confidence[], int host[], int protocol[]){
adj.assign(n+5,vll());
ll ans = 0;
ll c[n][2] = {0};
ll par[n];
ll col[n];
par[0] = col[0] = 0;
c[0][0]++;
f(i,0,n){
arr[i] = confidence[i];
}
f(i,1,n){
ll v = host[i];
if(protocol[i] == 0){
adj[v].pb(i);
adj[i].pb(v);
par[i] = par[v];
col[i] = col[v] ^ 1;
c[par[i]][col[i]]++;
}
else if(protocol[i] == 1){
for(auto x:adj[v]){
adj[i].pb(x);
adj[x].pb(i);
}
if(!adj[v].empty()){
par[i] = par[v];
col[i] = col[v];
c[par[i]][col[i]]++;
}
else{
par[i] = i;
col[i] = 0;
c[par[i]][col[i]]++;
}
}
else{
for(auto x:adj[v]){
adj[i].pb(x);
adj[x].pb(i);
}
adj[v].pb(i);
adj[i].pb(v);
}
}
f(i,0,n){
ans += max(c[i][0],c[i][1]);
}
return ans;
}
