#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
using pr = pair<int, int>;
const int INF = 1e9+7, MOD = 1e9+7;
vector<vector<int>> edge;
vector<array<int, 2>> dp;
vector<int> v;
void dfs(int node, int par) {
dp[node][1] = v[node];
for (auto next : edge[node]) {
if (next == par) continue;
dfs(next, node);
dp[node][0] += max(dp[next][0], dp[next][1]);
dp[node][1] += dp[next][0];
}
}
// Find out best sample
int findSample(int n,int a[],int host[],int type[]){
edge.resize(n);
v.resize(n);
for (int i = 0; i < n; i++) v[i] = a[i];
dp.resize(n, {0, 0});
for (int i = 1; i < n; i++) {
if (type[i] == 0) {
edge[i].pb(host[i]);
edge[host[i]].pb(i);
}
}
dfs(0, -1);
return max(dp[0][0], dp[0][1]);
}
