#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include "friend.h"
using namespace std;
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define pb push_back
#define ll long long
#define ui uint64_t
#define ar array
#define us unordered_set
#define cont(set, element) ((set).find(element) != (set).end())
/********* DEBUG *********/
template <typename T>
void outvec(const vector<T>& Z){
for (const T& x : Z)
cout << x << ' ';
cout << "\n";
}
void printVariable(const any& var) {
if (!var.has_value()) {
cout << "null";
return;
}
if (var.type() == typeid(int)) {
cout << any_cast<int>(var);
} else if (var.type() == typeid(double)) {
cout << any_cast<double>(var);
} else if (var.type() == typeid(float)) {
cout << any_cast<float>(var);
} else if (var.type() == typeid(char)) {
cout << any_cast<char>(var);
} else if (var.type() == typeid(bool)) {
cout << (any_cast<bool>(var) ? "true" : "false");
} else if (var.type() == typeid(string)) {
cout << any_cast<string>(var);
} else if (var.type() == typeid(const char*)) {
cout << any_cast<const char*>(var);
} else if (var.type() == typeid(long long)) {
cout << any_cast<long long>(var);
} else {
cout << "[unknown type]";
}
}
template<typename... Args>
void outval(Args... args) {
vector<any> variables = {args...};
for (size_t i = 0; i < variables.size(); ++i) {
printVariable(variables[i]);
if (i != variables.size() - 1) {
cout << " ";
}
}
cout << "\n";
}
#define nl "\n"
#define sp << " " <<
/********* DEBUG *********/
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll MOD3 = 1000000000;
const ll needMOD = 987654321;
const ll mxN = 100005;
const ll inf = 1e18;
void solve() {
}
int findSample(int n, int confidence[], int host[], int protocol[]){
vector<ll> take(n), ntake(n, 0);
for (int i = 0; i < n; i++)
take[i] = confidence[i];
for (int i = n-1; i >= 1; i--){
ll ch = host[i];
//if (i == n-1)
//outval("h, curr:",ch,i);
if (protocol[i] == 0){ // i am your friend
take[ch] += ntake[i];
ntake[ch] += max(take[i], ntake[i]);
//outval(take[i], ntake[ch]);
}
else if (protocol[i] == 1){ // my friends are your friends
take[ch] += max(take[i], ntake[i]);
ntake[ch] += ntake[i];
}
else{ // we are your friends
take[ch] = max(take[ch]+ntake[i], take[i]+ntake[ch]);
ntake[ch] += ntake[i];
}
}
//outval(take[0], ntake[0]);
return max(take[0], ntake[0]);
}
