#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
vector<vector<int>> adj;
vector<bool> vis;
const int mxN = 1000+5;
int dp[mxN][2];
vector<int> a;
void dfs(int u, int d=0) {
ll sm0=0, sm1=0, smx=0;
vis[u] = true;
for (auto v : adj[u]) {
//cout << u << " " << v << endl;
if (vis[v]) continue;
dfs(v, d+1);
sm0 += dp[v][0];
sm1 += dp[v][1];
smx += max(dp[v][0], dp[v][1]);
}
dp[u][0] = smx;
dp[u][1] = sm0+a[u];
}
int findSample(int n, int A[], int host[], int queries[]) {
vector<vector<int>> grid(n, vector<int>(n, 0));
vector<vector<int>> vadj(n);
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;
vadj[u].push_back(i);
vadj[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;
vadj[i].push_back(j);
vadj[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;
vadj[i].push_back(j);
vadj[j].push_back(i);
}
}
grid[u][i] = grid[i][u] = 1;
vadj[u].push_back(i);
vadj[i].push_back(u);
}
}
vis.assign(n, false);
memset(dp, 0, sizeof(dp));
for (int i=0; i<n; i++) {
if (vis[i]) continue;
queue<int> q;
q.push(i);
vis[i] = true;
while (!q.empty()) {
int u = q.front();
q.pop();
for (auto v : vadj[u]) {
if (!vis[v]) {
vis[v] = true;
adj[u].push_back(v);
adj[v].push_back(u);
q.push(v);
}
}
}
}
vis.assign(n, false);
int ans=0;
for (int i=0; i<n; i++) {
if (!vis[i]) {
dfs(i);
ans += max(dp[i][0], dp[i][1]);
}
}
return ans;
}
