#include<bits/stdc++.h>

using u32=unsigned int;
using i64=long long;
using u64=unsigned long long;

// #define ONLINE_JUDGE
#define INPUT_DATA_TYPE int
#define OUTPUT_DATA_TYPE i64
inline __attribute((always_inline)) INPUT_DATA_TYPE read(){register INPUT_DATA_TYPE x=0;register char f=0,c=getchar();while(c<'0'||'9'<c)f=(c=='-'),c=getchar();while('0'<=c&&c<='9')x=x*10+(c&15),c=getchar();return f?-x:x;}void print(OUTPUT_DATA_TYPE x){if(x<0)x=-x,putchar('-');if(x>9)print(x/10);putchar(x%10^48);return;}

#define il inline __attribute((always_inline)) 

std::vector<int> e[2][200010];

void addEdge(int u,int v,int op){
	e[op][u].push_back(v);
	e[op][v].push_back(u);
	// printf("%d %d\n",u,v);
	return;
}

namespace LCA{
#define ln(x) 31^__builtin_clz(x)
int cntDfn,dfn[200010],parsour[200010],depsour[200010];
#define ST_DATA_TYPE int
#define ST_TYPE >
const int ST_MAXI=200010;
const int ST_MAXJ=30;
ST_DATA_TYPE ST_CALC(ST_DATA_TYPE a,ST_DATA_TYPE b){return depsour[a]<depsour[b]?a:b;}
struct ST{
	ST_DATA_TYPE f[ST_MAXJ][ST_MAXI];

	void build(int size){
		register int i,j;
		int k=ln(size);
		for(j=1;j<=k;++j)
			for(i=1;i<=size-(1<<j)+1;++i)
				f[j][i]=ST_CALC(f[j-1][i],f[j-1][i+(1<<(j-1))]);
		return;
	}

	ST_DATA_TYPE query(int l,int r){
        if(l==r) return l;
        l=dfn[l];
        r=dfn[r];
        if(l>r) std::swap(l,r);
        ++l;
		int k=ln(r-l+1);
        int u=f[k][l];
        int v=f[k][r-(1<<k)+1];
        if(depsour[u]<depsour[v]) return parsour[u];
        else return parsour[v];
	}
}st;

void dfsLca(int u,int p){
    depsour[u]=depsour[p]+1;
    st.f[0][dfn[u]=++cntDfn]=u;
    parsour[u]=p;
    for(auto v:e[0][u])
        if(v!=p)
            dfsLca(v,u);
}

int getDis(int u,int v){return depsour[u]+depsour[v]-(depsour[st.query(u,v)]<<1);}
};


u64 val[200010];
i64 res;
char vis[200010],in2[200010];
int siz[200010],par[200010],incur[200010],sumsiz,root,n,id,siznow;

std::map<u64,int> cnt[3][3];

int getcent(int u,int p){
    ++sumsiz;
    ++siznow;
    incur[u]=id;
    register int siz=1,sizv,max=0;
    for(auto v:e[0][u]) if(v!=p&&!vis[v]){
        siz+=(sizv=getcent(v,u));
        max=std::max(max,sizv);
    }
    max=std::max(max,n-siz);
    if(max<=n/2) root=u;
    return siz;
}

void dfspar(int u,int p){
    ++sumsiz;
    siz[u]=1;
    if(p==root) par[u]=0;
    else par[u]=p;
    for(auto v:e[0][u]) if(v!=p&&incur[v]==id) dfspar(v,u),siz[u]+=siz[v];
    return;
}

// void dfs()

void solve(int t){
    ++id;
    sumsiz+=n,root=-1;
	register int i,j,u,root,nx,ny,t1,t2;
    getcent(t,0);
    root=::root;
	dfspar(root,0);



	for(i=0;i<3;++i) for(j=0;j<3;++j) cnt[i][j].clear();

	cnt[1][0][0]=cnt[0][0][0]=1;

	for(auto v:e[1][root]) if(incur[v]==id){
		auto dfs=[&](int u,int p,int z,u64 now,int x,int y,int op,auto &&dfs) ->void {
            ++sumsiz;
			now^=val[u]^val[par[u]],z+=(par[u]==0);
            nx=x,ny=y;
            if((t1=LCA::getDis(x,u))>(t2=LCA::getDis(nx,ny))) nx=x,ny=u,t2=t1;
            if((t1=LCA::getDis(u,y))>t2) nx=u,ny=y,t2=t1;
            
            std::vector<int> cur({x,y,u});
            for(auto v:cur) if(LCA::getDis(v,nx)+LCA::getDis(v,ny)!=t2) return;
            x=nx,y=ny;

			if((~x)&&z<=2){
				std::vector<std::pair<int,u64>> vec({{0,now},{1,now^val[x]}});
				if(x^y) vec.push_back({2,now^val[x]^val[y]}),vec.push_back({1,now^val[y]});
				if(op) for(auto [c,now]:vec) ++cnt[c][z][now];
				else{
					auto get=[&](int x,int y,u64 now){
						for(i=0;i<=2;++i){
							int z=x+i-y;
							if(x+i>2||z<0||z>2) continue;
							res+=cnt[i][z][now];
						}
					};
					for(auto [c,now]:vec) get(c,z,now);
				}
				for(auto v:e[1][u]) if(v!=p&&incur[v]==id) dfs(v,u,z,now,x,y,op,dfs);
			}
			return;
		};
		dfs(v,root,0,0,v,v,0,dfs);
		dfs(v,root,0,0,v,v,1,dfs);
		
	}

	vis[root]=1;
	for(auto v:e[0][root]) if(!vis[v])
		n=siz[v],solve(v);

	return;
}

int main(){
	// #ifndef ONLINE_JUDGE
	// freopen("line/line2.in", "r", stdin);
	// freopen("name.out", "w", stdout);
	// #endif

	std::mt19937_64 mt(time(0));

	// int T=read();
	int T=1;

	while(T--){

		register int i;
		int n=read();

		for(i=1;i<=n;++i) val[i]=mt();

		for(i=2;i<=n;++i) addEdge(read(),i,0);
		for(i=2;i<=n;++i) addEdge(read(),i,1);
		
		LCA::cntDfn=0;
		LCA::dfsLca(1,0);
		LCA::st.build(n);

        fprintf(stderr,"%lf\n",1.0*clock()/CLOCKS_PER_SEC);

        ::n=n,res=0,solve(1);

		print(res+n),putchar('\n');
		for(i=1;i<=n;++i) e[0][i].clear(),e[1][i].clear(),vis[i]=0;
	}

    fprintf(stderr,"siz: %d\n%lf\n",sumsiz,1.0*clock()/CLOCKS_PER_SEC);

	#ifndef ONLINE_JUDGE
	fclose(stdin);
	fclose(stdout);
	#endif
    return 0;
}


/*
1
10
10 9 7 10 2 1 5 5 4
8 7 7 1 8 5 7 7 4

0 0 0 1
0 0 0 1
0 0 0 1
0 0 0 1
0 0 0 1

*/