#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
vector<vector<int>> adj;
const int mxN = 1000+5;
ll dp[mxN][2];
vector<int> a;
void dfs(int u, int p=-1) {
ll sm0=0; //suma de no usar los hijos
ll sm1=0; //suma de usar los hijos
ll smx=0;
for (auto v : adj[u]) {
if (v==p) continue;
dfs(v, u);
sm0 += dp[v][0];
sm1 += dp[v][1];
smx += max(dp[v][0], dp[v][1]);
}
dp[u][0] = smx;
dp[u][1] = a[u] + sm0;
//cout << u << " " << sm0 << " " << sm1 << " " << dp[u][0] << " " << dp[u][1] << endl;
}
int findSample(int n, int A[], int host[], int queries[]) {
vector<vector<int>> grid(n, vector<int>(n, 0));
adj.assign(n, {});
a.assign(n, 0);
for (int i=0; i<n; i++) {
a[i] = A[i];
}
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;
adj[i].push_back(j);
adj[j].push_back(i);
}
}
}
else {
for (int j=0; j<i; j++) {
if (grid[u][j]) {
//cout << i << " " << j << endl;
grid[i][j] = grid[j][i] = 1;
adj[i].push_back(j);
adj[j].push_back(i);
}
}
grid[u][i] = grid[i][u] = 1;
adj[u].push_back(i);
adj[i].push_back(u);
}
}
memset(dp, 0, sizeof(dp));
dfs(0);
return max(dp[0][0], dp[0][1]);
}
