#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
#define pb push_back
#define sz(s) (int)s.size()
const int N = (int)1e5 + 7;
const int smN = (int)1e3 + 7;
vector < int > gr[N];
int has[smN][smN];
int c[N];
void addedge(int a, int b) {
gr[a].pb(b);
gr[b].pb(a);
has[a][b] = has[b][a] = 1;
}
int res = 0;
void dfs(int v, int pr, bool fl) {
if (fl) {
res += c[v];
}
for (int to : gr[v]) {
if (to == pr) continue;
dfs(to, v, fl ^ 1);
}
}
int findSample(int n, int confidence[], int host[], int protocol[]){
for (int i = 0; i < n; i++) c[i] = confidence[i];
int ans = 0;
for (int i = 1; i < n; i++) {
if (protocol[i] == 0 || protocol[i] == 2) {
addedge(host[i], i);
}
if (protocol[i] == 1 || protocol[i] == 2) {
for (int to : gr[host[i]]) {
addedge(to, i);
}
}
}
for (int i = 0; i < n; i++) {
res = 0;
dfs(i, i, 1);
ans = max(ans, res);
}
return ans;
}
