#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
vector<vector<int>> adj;
vector<int> h;
void dfs(int u, int p=-1, int d=0) {
h[u] = d;
for (auto v : adj[u]) {
if (v==p) continue;
dfs(v, u, d+1);
}
}
int findSample(int n, int a[], int host[], int queries[]) {
vector<vector<int>> grid(n, vector<int>(n, 0));
adj.assign(n, {});
h.assign(n, 0);
for (int i=1; i<n; i++) {
int u = host[i];
if (queries[i] == 0) {
grid[u][i] = grid[i][u] = 1;
adj[u].push_back(i);
adj[i].push_back(u);
}
else if (queries[i] == 1) {
for (int j=0; j<i; j++) {
if (grid[u][j]) {
//cout << i << " " << j << endl;
grid[i][j] = grid[j][i] = 1;
}
}
}
else {
for (int j=0; j<i; j++) {
if (grid[u][j]) {
//cout << i << " " << j << endl;
grid[i][j] = grid[j][i] = 1;
}
}
grid[u][i] = grid[i][u] = 1;
}
}
int ev=0, odd=0;
dfs(0);
for (int i=0; i<n; i++) {
if (h[i]&1) odd += a[i];
else ev += a[i];
}
return max(ev, odd);
}
