#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n;
int fa[200005];

int cnt;
int head[200005];
struct eg{
	int to,nxt;
}edge[400005];

void make(int u,int v){
	edge[++cnt].to = v;
	edge[cnt].nxt = head[u];
	head[u] = cnt;
}
mt19937_64 rnd(0);
ull a[200005];

int siz[200005],h[200005],inq[200005],vis[200005];
vector <int> S;
void dfs1(int u,int f){
	siz[u] = 1;
	inq[u] = 1;
	h[u] = 0;
	S.eb(u);
	for(int i = head[u];i;i = edge[i].nxt){
		int v = edge[i].to;
		if(v == f || vis[v]) continue;
		dfs1(v,u);
		siz[u] += siz[v];
		chkmax(h[u],siz[v]);
	}
}

int N;
vector <int> G[200005];
int col[200005],dep[200005],cov[200005];
ull sum[2][200005];
int Mx[200005][2],frp[200005];
void dfs2(int u,int f){
	if(cov[u] < N) frp[u] = 0;
	for(int i = head[u];i;i = edge[i].nxt){
		int v = edge[i].to;
		if(v == f) continue;
		sum[0][v] = sum[0][u] + a[v];
		Mx[v][0] = Mx[u][0];Mx[v][1] = Mx[u][1];
		frp[v] = frp[u];
		int p = v;
		if(dep[Mx[v][0]] < dep[p]) swap(p,Mx[v][0]);
		if(dep[Mx[v][1]] < dep[p] && col[p] != col[Mx[v][0]]) Mx[v][1] = p;
		dfs2(v,u);
	}
}

void dfs3(int u,int f,int c){
	cov[u] = N;
	col[u] = c;
	for(int v:G[u]){
		if(v == f) continue;
		sum[1][v] = sum[1][u] + a[v];
		dep[v] = dep[u] + 1;
		dfs3(v,u,c);
	}
}

ll ans,answer;
map <ull,int> buc[3];
void test(ull val,int sz){
//	printf("test %llu\n",val);
	rep(i,0,2 - sz) ans += buc[i][-val];
	buc[sz][val]++;
}

void add(int u){
//	printf("add %d\n",u);
	if(!frp[u]) return;
	test(sum[0][u],0);
	if(Mx[u][0]) test(sum[0][u] - sum[1][Mx[u][0]],1);
	if(Mx[u][1]){
		test(sum[0][u] - sum[1][Mx[u][1]],1);
		test(sum[0][u] - sum[1][Mx[u][1]] - sum[1][Mx[u][0]],2);
	}
}

void dfs4(int u,int f){
	add(u);
	for(int i = head[u];i;i = edge[i].nxt){
		int v = edge[i].to;
		if(v == f) continue;
		dfs4(v,u);
	}
}

void solve(int rt){
	++N;
	S.clear();
	dfs1(rt,0);
	int heavy = rt;
	for(int u:S) if(max(h[u],siz[rt] - siz[u]) <= max(h[heavy],siz[rt] - siz[heavy])) heavy = u;
//	printf("solve:\n");
//	for(int u:S) printf("%d ",u);
//	printf("\nheavy=%d\n",heavy);

	for(int u:S){
		if(inq[fa[u]]){
			G[fa[u]].eb(u);
			G[u].eb(fa[u]);
		}
	}
	col[heavy] = 0;
	cov[heavy] = N;
	for(int v:G[heavy]){
		dep[v] = 1;
		sum[1][v] = a[v];
		dfs3(v,heavy,v);
	}
	sum[0][heavy] = sum[1][heavy] = 0;
	Mx[heavy][0] = Mx[heavy][1] = 0;
	frp[heavy] = 1;
	dfs2(heavy,0);
//	for(int u:S) printf("%d Mx[0] %d Mx[1] %d %llu dep %d frp %d\n",u,Mx[u][0],Mx[u][1],sum[1][u],dep[u],frp[u]);

	ans = 0;
	for(int u:S) add(u);
	answer += ans;
	buc[0].clear();buc[1].clear();buc[2].clear();
//	printf("%lld\n",answer);

	ans = 0;
	for(int i = head[heavy];i;i = edge[i].nxt){
		if(vis[edge[i].to]) continue;
		dfs4(edge[i].to,heavy);
		buc[0].clear();buc[1].clear();buc[2].clear();
	}
	answer -= ans;
//	printf("%lld\n",answer);
	for(int u:S){
		inq[u] = 0;
		G[u].clear();
	}

	vis[heavy] = 1;
	for(int i = head[heavy];i;i = edge[i].nxt) if(!vis[edge[i].to]) solve(edge[i].to);
}

int main(){
//	freopen("test.in","r",stdin);
//	freopen("test.out","w",stdout);
	dep[0] = -1;
	scanf("%d",&n);
	rep(u,2,n){
		scanf("%d",&fa[u]);
		make(fa[u],u);
		make(u,fa[u]);
	}
	rep(u,1,n) a[u] = rnd();
//	rep(u,1,n) printf("%llu ",a[u]);
//	printf("\n");
	rep(u,2,n) scanf("%d",&fa[u]);
	solve(1);
	printf("%lld\n",answer + n);
	return 0;
}