/*
start coding at : 20:20
*/
#include<bits/stdc++.h>
#define L(i,s,t) for(int i=(s);i<=(t);++i)
#define R(i,s,t) for(int i=(s);i>=(t);--i)
#define T(i,s,t) for(int i=(s);i< (t);++i)
#define iV inline void
#define iI inline int
#define gc getchar
#define eb emplace_back
#define ll long long
#define ull unsigned ll
using namespace std;
iI read() {
    int x=0;char c=gc();
    while(!isdigit(c)) c=gc();
    while(isdigit(c)) x=x*10+(c^48),c=gc();
    return x;
}
iV chx(int &x,int y) {x=x>y?x:y;}
const int N=2e5+3;
mt19937_64 yml(20070505);
int n;
ll ans;
ull rd[N];
vector<int> e1[N],e2[N];
//点分治
int rt,all,sz[N],mx[N]={N};
bool vis[N],cur[N];
iV RT(int u,int fa) {
    sz[u]=1,mx[u]=0;
    for(int v:e1[u]) if(v^fa&&!vis[v]) 
    RT(v,u),sz[u]+=sz[v],chx(mx[u],sz[v]);
    chx(mx[u],all-sz[u]);
    if(mx[u]<mx[rt]) rt=u;
}
iV SZ(int u,int fa) {
    sz[u]=1;
    for(int v:e1[u]) if(v^fa&&!vis[v]) 
    SZ(v,u),sz[u]+=sz[v];
}
int cl,c[N],lv[N]={-1};
ull v1[N],v2[N];
iV T2(int u,int fa,int col) {
    v2[u]=v2[fa]^rd[u],c[u]=col,lv[u]=lv[fa]+1;
    for(int v:e2[u]) if(v^fa&&!vis[v]) T2(v,u,col);
}
int P,U,lim[N];
struct node{ull v;int c;}p[N<<1];
ull t1[N],t2[N];
int ct1,ct2;
iV T1(int u,int fa,int a,int b) {
    if(a&&c[u]^c[a]&&b&&c[u]^c[b]) return;
    if(!a) a=u;
    else if(c[a]==c[u]&&lv[u]>lv[a]) a=u;
    else if(c[a]!=c[u]&&lv[u]>lv[b]) b=u;
    t1[++ct1]=v1[u]=v1[fa]^rd[u];
    if(a) p[++P]={v1[u]^v2[a],c[a]};
    if(b) p[++P]={v1[u]^v2[b],c[b]};
    if(a&&b) t2[++ct2]=v1[u]^v2[a]^v2[b];
    for(int v:e1[u]) if(v^fa&&!vis[v]) T1(v,u,a,b);
}
iV calc_case1(int l,int r,int x,int y,int k) {
    sort(t1+l,t1+r+1),sort(t2+x,t2+y+1);
    int cnt=0;
    L(i,l,r) {
        if(i>l&&t1[i]==t1[i-1]) {ans+=k*cnt;continue;}
        cnt=0;
        while(x<=y&&t2[x]^t1[i]) ++x;
        if(x>y) return;
        while(x<=y&&t2[x]==t1[i]) ++x,++cnt;
        ans+=k*cnt;
    }
}
unordered_map<int,int> mp[N];
int sum[N];
iV upd(node i) {++mp[i.v][i.c],++sum[i.v];}
iI que(node i) {return sum[i.v]-mp[i.v][i.c];}
iV calc_case2() {
    static ull v[N<<1];int V=0;
    L(i,1,P) v[V++]=p[i].v;sort(v,v+V),V=unique(v,v+V)-v;
    L(i,1,P) p[i].v=lower_bound(v,v+V,p[i].v)-v;
    L(i,1,U) {
        int l=lim[i-1]+1,r=lim[i];
        L(j,l,r) ans+=que(p[j]);L(j,l,r) upd(p[j]);
    }
    T(i,0,V) sum[i]=0,mp[i].clear();
}
iV sol(int s) {
    vis[s]=1,v1[s]=v2[s]=rd[s],cl=lv[s]=c[s]=0;
    for(int v:e2[s]) if(!vis[v]) T2(v,s,++cl);
    p[P=1]={0,c[s]},lim[U=1]=1,t1[ct1=1]=v1[s],ct2=0;
    for(int v:e1[s]) if(!vis[v]) {
        int tc1=ct1,tc2=ct2;
        T1(v,s,s,0),lim[++U]=P;
        calc_case1(tc1+1,ct1,tc2+1,ct2,-1);
    }
    calc_case1(1,ct1,1,ct2,1),calc_case2();
    SZ(s,0);
    for(int v:e1[s]) if(!vis[v]) all=sz[v],RT(v,rt=0),sol(rt);
}
int main() {
    n=ans=read();
    L(i,2,n) {int j=read();e1[i].eb(j),e1[j].eb(i);}    
    L(i,2,n) {int j=read();e2[i].eb(j),e2[j].eb(i);}
    L(i,1,n) rd[i]=yml();
    all=n,RT(1,0),sol(rt);
    cout<<ans<<"\n";
    return 0;
}