#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000

int N;
vector<vector<int>> E;
vector<int> a;
vector<long long> b;
vector<vector<int>> ps;

vector<vector<long long>> v;

void dfs(int cur){
	if(E[cur].size()==0){
		ps[cur] = {a[cur],N};
		v[cur] = {b[cur],0};
		return;
	}
	
	vector<int> pp(1,a[cur]);
	
	rep(i,E[cur].size()){
		int to = E[cur][i];
		dfs(to);
		rep(j,ps[to].size())pp.push_back(ps[to][j]);
	}
	sort(pp.begin(),pp.end());
	pp.erase(unique(pp.begin(),pp.end()),pp.end());
	
	v[cur].resize(pp.size());
	
	rep(i,E[cur].size()){
		int to = E[cur][i];
		rep(j,ps[to].size()){
			int d0 = -1;
			if(j!=0)d0 = distance(pp.begin(),lower_bound(pp.begin(),pp.end(),ps[to][j-1]));
			int d1 = distance(pp.begin(),lower_bound(pp.begin(),pp.end(),ps[to][j]));
			v[cur][d1] += v[to][j];
			if(d0!=-1)v[cur][d0] -= v[to][j];
		}
	}
	
	for(int i=v[cur].size()-1;i>=1;i--)v[cur][i-1] += v[cur][i];
	for(int i=v[cur].size()-1;i>=1;i--)v[cur][i-1] = max(v[cur][i-1],v[cur][i]);
	
	int d = distance(pp.begin(),lower_bound(pp.begin(),pp.end(),a[cur]));
	v[cur][d] += b[cur];
	for(int i=v[cur].size()-1;i>=1;i--)v[cur][i-1] = max(v[cur][i-1],v[cur][i]);
		
	
	rep(i,E[cur].size()){
		int to = E[cur][i];
		ps[to].clear();
		v[to].clear();
	}
	
	ps[cur] = pp;
	/*
	cout<<cur<<endl;
	rep(i,ps[cur].size()){
		cout<<ps[cur][i]<<','<<v[cur][i]<<endl;
	}
	*/
	
}

int main(){
	
	cin>>N;
	
	E.resize(N);
	
	rep(i,N-1){
		int p;
		scanf("%d",&p);
		p--;
		E[p].push_back(i+1);
	}
	
	a.resize(N);
	b.resize(N);
	
	rep(i,N){
		scanf("%d",&a[i]);
		a[i]--;
	}
	rep(i,N)scanf("%lld",&b[i]);
	
	ps.resize(N);
	v.resize(N);
	dfs(0);
	
	cout<<v[0][0]<<endl;
	
    return 0;
}