//In the name of God
#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll maxn = 2e5 + 100;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("input.txt", "r+", stdin);freopen("output.txt", "w+", stdout);
#define pb push_back
#define Mp make_pair
#define F first
#define S second
#define Sz(x) ll((x).size())
#define all(x) (x).begin(), (x).end()
ll dp[maxn][2];
int findSample(int n,int confidence[],int host[],int protocol[]){
for(ll i = 0; i < n; i++){
dp[i][1] = confidence[i];
}
for(ll u = n - 1; u > 0; u--){
ll v = host[u];
if(protocol[u] == 0){
dp[v][0] += max(dp[u][0], dp[u][1]);
dp[v][1] += dp[u][0];
}
if(protocol[u] == 1){
dp[v][0] += dp[u][0];
dp[v][1] = max(dp[v][0] + dp[u][1], dp[v][1] + max(dp[u][0], dp[u][1]));
}
if(protocol[u] == 2){
dp[v][0] += dp[u][0];
dp[v][1] = max(dp[v][1] + dp[u][0], dp[v][0] + dp[u][1]);
}
}
return max(dp[0][0], dp[0][1]);
}
/*int main(){
fast_io;
return 0;
}
*/
