#include "friend.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define V vector
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;
const int INF = 1e9 + 7, N = 1e5 + 7;
int dp[N][2];
int findSample(int n, int a[], int host[], int op[]) {
for(int i = 0; i < n; i++)
dp[i][0] = 0, dp[i][1] = a[i];
for(int i = n - 1; i >= 1; i--) {
int j = host[i];
if(op[i] == 0) {
dp[j][0] += max(dp[i][0], dp[i][1]);
dp[j][1] += dp[i][0];
} else if(op[i] == 1) {
dp[j][1] = max({dp[j][1] + dp[i][0], dp[j][0] + dp[i][1], dp[i][1] + dp[j][1]});
dp[j][0] += dp[i][0];
} else {
dp[j][1] = max(dp[j][1] + dp[i][0], dp[j][0] + dp[i][1]);
dp[j][0] += dp[i][0];
}
}
return max(dp[0][0], dp[0][1]);
}
