#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
//#include "friend.h"
// Find out best sample
vector<int> adj[100001];
int vis[100001];
int aa[100001];
int co[2];
void dfs(int no,int levv=0){
co[levv]+=aa[no];
vis[no]=1;
for(auto j:adj[no]){
if(vis[j]==0){
// cout<<no<<","<<j<<endl;
dfs(j,(levv+1)%2);
}
}
}
int findSample(int n,int it[],int par[],int pp[]){
int ans=0;
for(int i=0;i<n;i++){
aa[i]=it[i];
}
//cout<<pp[0]<<endl;
for(int i=1;i<n;i++){
if(pp[i]==0){
adj[par[i]].pb(i);
adj[i].pb(par[i]);
}
else{
for(auto j:adj[par[i]]){
adj[j].pb(i);
adj[i].pb(j);
//cout<<j<<":"<<i+1<<endl;
}
}
}
for(int i=0;i<n;i++){
if(vis[i]==0){
co[0]=0;
co[1]=0;
// cout<<i<<endl;
dfs(i);
ans+=max(co[0],co[1]);
}
}
return ans;
}
/*int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
return 0;
}*/
/*
g++ -o aa -O2 friend.cpp grader.cpp -std=c++14
*/
/*
2
10 20
0 1
*/
/*2
10 20
0 0
3
1 1 1
0 0 0 1
*/
