#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cerr << #x << ": " << x << '\n';

#define FORI(i,a,b) for (int i = (a); i < (b); ++i)
#define FOR(i,a) FORI(i,0,a)
#define ROFI(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define ROF(i,a) ROFI(i,0,a)
#define rep(a) FOR(_,a)
#define each(a,x) for (auto& a: x)
#define FORN(i, n) FORI(i, 1, n + 1)

using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::pair <T, T> & data)
{
    input >> data.x >> data.y;
    return input;
}
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
    for (T& x : data)
        input >> x;
    return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
ll gcd(ll a, ll b) {
    while (b) {
        tie(a, b) = mp(b, a % b);
    }
    return a;
}
int Bit(int mask, int bit) { return (mask >> bit) & 1; }
signed main() {
    #ifdef LOCAL
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int n;
    cin >> n;
    vi p(n + 1);
    FORI (i, 2, n + 1) {
        cin >> p[i];
    }
    vi a(n + 1), b(n + 1);
    FORN (i, n) {
        cin >> a[i];
    }
    FORN (i, n) {
        cin >> b[i];
    }   
    V <map <int, int> > d(n + 1);
    ROFI (i, 1, n + 1) {
        if (b[i] > d[i][a[i]]) {
            int de = b[i] - d[i][a[i]];
            while (1) {
                map<int, int>::iterator t = d[i].find(a[i]);
                if (t == d[i].begin()) {
                    break;
                }
                else if (prev(t)->y >= de) {
                    prev(t)->y -= de;
                    break;
                }
                else {
                    de -= prev(t)->y;
                    d[i].erase(prev(t)->x);
                }
            }
            /*
            if (t != d[i].begin()) {
                
                ckmax(prev(t)->y, 0ll);
            }
            */
            d[i][a[i]] = b[i];
        }

        /*
        debug(i);
        each (e, d[i]) {
            debug(mp(e.x, e.y));
        }
        */

        if (i != 1) {
            if (d[i].size() > d[p[i]].size()) {
                swap(d[i], d[p[i]]);
            }
            each (e, d[i]) {
                d[p[i]][e.x] += e.y;
            }
            d[i].clear();
        }
    }
    int ans = 0, cur = 0;
    V <ii> ord;
    each (e, d[1]) {
        ord.app(e);
    }
    reverse(all(ord));
    each (e, ord) {
        cur += e.y;
        ckmax(ans, cur);
    }
    cout << ans << endl;
}