#include "friend.h"
#include <bits/stdc++.h>

using namespace std;

namespace {

const int N = 1e5 + 7;

int n;
int a[N];
int p[N], tp[N];
int dp[N][2];
vector<int> g[N];
int dp1[2][2], ndp1[2][2];

}

void dfs(int v) {
	for (int u : g[v]) {
		dfs(u);
	}
	dp[v][0] = dp[v][1] = 0;
	for (int fv = 0; fv < 2; ++fv) {
		memset(dp1, 0, sizeof dp1);
		for (int u : g[v]) {
			memset(ndp1, 0, sizeof ndp1);
			for (int f1 = 0; f1 < 2; ++f1) {
				for (int f2 = 0; f2 < 2; ++f2) {
					for (int fu = 0; fu < 2; ++fu) {
						if (f1 && fu && tp[u] != 0) {
							continue;	
						}
						// if (f2 && fu && tp[u] != 1) {
						// 	continue;
						// }
						if (fv && fu && tp[u] != 1) {
							continue;
						}
						int nf1 = f1 || (fu && tp[u] != 1);
						int nf2 = f2 || (fu && tp[u] != 0);
						ndp1[nf1][nf2] = max(ndp1[nf1][nf2], dp1[f1][f2] + dp[u][fu]);
					}
				}
			}
			memcpy(dp1, ndp1, sizeof dp1);
		}
		for (int f1 = 0; f1 < 2; ++f1) {
			for (int f2 = 0; f2 < 2; ++f2) {
				int f = f2 || fv;
				dp[v][f] = max(dp[v][f], dp1[f1][f2] + fv * a[v]);
			}
		}
	}
}

int findSample(int grdn, int grda[], int grdp[], int grdtp[]){
	n = grdn;
	for (int i = 0; i < n; ++i) {
		a[i] = grda[i];
	}
	for (int i = 1; i < n; ++i) {
		p[i] = grdp[i];
		tp[i] = grdtp[i];
		g[p[i]].push_back(i);
	}
	dfs(0);
	return max(dp[0][0], dp[0][1]);
}