#include<vector>
#include<set>
#include<map>
#include<queue>
#include<string>
#include<algorithm>
#include<iostream>
#include<bitset>
#include<functional>
#include<numeric>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cassert>
#include<cmath>
#include<iomanip>
#include<random>
#include<ctime>
#include<complex>
using namespace std;
typedef long long LL;
typedef double D;
#define all(v) (v).begin(), (v).end()
mt19937 gene(233);
typedef complex<double> Complex;
#define fi first
#define se second
#define ins insert
#define pb push_back
inline char GET_CHAR(){
    const int maxn = 131072;
    static char buf[maxn],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,maxn,stdin),p1==p2)?EOF:*p1++;
}
inline int getInt() {
    int res(0);
    char c = getchar();
    while(c < '0') c = getchar();
    while(c >= '0') {
        res = res * 10 + (c - '0');
        c = getchar();
    }
    return res;
}

inline LL fastpo(LL x, LL n, LL mod) {
    LL res(1);
    while(n) {
        if(n & 1) {
            res = res * (LL)x % mod;
        }
        x = x * (LL) x % mod;
        n /= 2;
    }
    return res;
}
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }

inline string itoa(int x, int width = 0) {
    string res;
    if(x == 0) res.push_back('0');
    while(x) {
        res.push_back('0' + x % 10);
        x /= 10;
    }
    while((int)res.size() < width) res.push_back('0');
    reverse(res.begin(), res.end());
    return res;
}
const int _B = 131072;
char buf[_B];
int _bl = 0;
inline void flush() {
    fwrite(buf, 1, _bl, stdout);
    _bl = 0;
}
__inline void _putchar(char c) {
    if(_bl == _B) flush();
    buf[_bl++] = c;
}
inline void print(LL x, char c) {
    static char tmp[20];
    int l = 0;
    if(!x) tmp[l++] = '0';
    else {
        while(x) {
            tmp[l++] = x % 10 + '0';
            x /= 10;
        }
    }
    for(int i = l - 1; i >= 0; i--) _putchar(tmp[i]);
    _putchar(c);
}
struct P {
    D x, y;
};
const int N = 300033;
const int LOG = 20;
const int mod = 1e9 + 7;
const int inf = 1e9 + 7;
int n, m;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int fa[N], a[N], b[N];
map<int, LL> mp[N];
int main() {
    int n;
    scanf("%d", &n);
    for(int i = 2; i <= n; i++) {
        scanf("%d", &fa[i]);
    }
    for(int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
    }
    for(int i = 1; i <= n; i++) {
        scanf("%d", &b[i]);
    }
    for(int i = n; i >= 1; i--) {
        /*printf("%d\n", i);
        for(auto itr : mp[i]) printf("[%d %I64d]", itr.fi, itr.se);
        printf("\n");*/
        mp[i][a[i]] = b[i];
        
        auto itr = mp[i].find(a[i]);
        LL sum = 0;

        while(itr != mp[i].begin()) {
            itr--;
            sum += itr->se;
            if(sum <= b[i]) {
                mp[i].erase(itr);
                itr = mp[i].find(a[i]);
            }else {
                itr->se = sum - b[i];
                break;
            }
        }
        /*printf("%d\n", i);
        for(auto itr : mp[i]) printf("[%d %I64d]", itr.fi, itr.se);
        printf("\n");*/
        if(i == 1) break;
        if(mp[fa[i]].size() < mp[i].size()) {
            swap(mp[fa[i]], mp[i]);
            
        }
        for(auto itr : mp[i]) {
                mp[fa[i]].insert(itr);
            }
    }
    LL ans = 0;
    for(auto itr : mp[1]) {
        ans += itr.se;
    }
    cout << ans << endl;
}