#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int findSample(int n, int a[], int host[], int queries[]) {
vector<vector<int>> grid(n, vector<int>(n, 0));
for (int i=1; i<n; i++) {
int u = host[i];
if (queries[i] == 0) {
grid[u][i] = grid[i][u] = 1;
}
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 ans=0;
for (int b=0; b<(1<<n); b++) {
int sm=0;
bool can = true;
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
if ((b&(1<<i)) && (b&(1<<j))) {
if (grid[i][j]) can = false;
}
}
}
if (!can) continue;
for (int i=0; i<n; i++) {
if (b&(1<<i)) {
sm += a[i];
}
}
ans = max(ans, sm);
}
return ans;
}
