#include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename L> using gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define Return(ans) { cout << (ans) << endl; return 0; }
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
using Pdi = pair<double, int>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod

struct UnionFind
{
    vector<int> par, sz;
    int n_cc;

    UnionFind(int N){
        par = vector<int>(N);
        REP(i, N) par[i] = i;
        sz = vector<int>(N, 1);
        n_cc = N;
    }

    int find(int x){
        if(par[x] == x) return x;
        else return par[x] = find(par[x]);
    }

    void unite(int x, int y){
        x = find(x);
        y = find(y);
        if(x == y) assert(false);//return;

        //if(sz[x] < sz[y]) swap(x, y);
        if(y > x) swap(x, y);

        par[y] = x;
        sz[x] += sz[y];
        n_cc--;
    }

    bool is_union(int x, int y){
        x = find(x);
        y = find(y);
        return x == y;
    }

    int union_size(int x){
        return sz[find(x)];
    }

};


struct edge{int to, cost, id;};

class Graph
{
public:
    int N;
    vector<vector<edge>> G, G2;
    vec V;
    vec cnt, par;

    Graph(int N): N(N){
        G = vector<vector<edge>>(N, vector<edge>(0));
        
        cnt = vec(3 * N, 0);
        par = vec(3 * N, -1);
    }

    void add_Directed_edge(int from, int to, int cost = 1, int id = 0){
        G[from].push_back(edge({to, cost, id}));
    }

    void add_Undirected_edge(int v1, int v2, int cost = 1, int id = 0){
        add_Directed_edge(v1, v2, cost, id);
        add_Directed_edge(v2, v1, cost, id);
    }

    void dfs1(int v){
        if(V[v] == 0) cnt[v]++;
        for(auto e: G[v]){
            dfs1(e.to);
            cnt[v] += cnt[e.to];
        }
    }

    void dfs2(int s, int v){
        for(auto e: G[v]){
            if(V[e.to] == 1){
                par[e.to] = s;
                cnt[s] -= cnt[e.to];
            }else dfs2(s, e.to);
        }
    }

    int calcans(){

        bools used(3 * N, false);
        vec ans(3 * N, 0), sz(3 * N, 0);

        UnionFind UF(3 * N);
        priority_queue<Pdi> que;
        REP(i, N) if(V[i] == 1){
            que.push(Pdi(cnt[i], i));
            ans[i] = cnt[i];
            sz[i] = 1;
        }

        int n = N;

        while(!que.empty()){
            int v = que.top().s; que.pop();
            if(used[v]) continue;
            if(par[v] == -1) continue;

            int p = UF.find(par[v]);

            //debug(v); debug(p);

            cnt[n] = cnt[p] + cnt[v];
            sz[n] = sz[p] + sz[v];
            ans[n] = ans[p] + ans[v] + cnt[v] * sz[p];

            if(par[p] == -1) par[n] = -1;
            else par[n] = UF.find(par[p]);
            UF.unite(v, n);
            UF.unite(p, n);

            used[v] = true; used[p] = true;
            que.push(Pdi((double)cnt[n] / sz[n], n));
            n++;
        } 

        return ans[n - 1];
    }

};

signed main(){

    int N; cin >> N;
    Graph G(N);
    FOR(i, 1, N){
        int p; cin >> p;
        G.add_Directed_edge(p - 1, i);
    }
    vec V(N); cin >> V;

    int T = 0;
    if(V[0] == 0){
        FOR(i, 1, N) if(V[i] == 0) T++;
        V[0] = 1;
    }
    G.V = V;

    int t = 0;
    int ans;
    FOR(i, 1, N) t += V[i];
    if(t == 0){
        ans = N - 1;
    }else{
        G.dfs1(0);
        REP(i, N) if(V[i] == 1) G.dfs2(i, i);
        ans = G.calcans();
    }

    ans -= T;
    Out(ans);

    return 0;
}


Measured memory_bytes: 51184