Problem: Snuke has a rooted tree with N vertices, numbered 1 through N. Vertex 1 is the root of the tree, and the parent of Vertex i ( 2\leq i \leq N ) is Vertex P_i ( P_i < i ). There is a number, 0 or 1, written on each vertex. The number written on Vertex i is V_i.

Snuke would like to arrange the vertices of this tree in a horizontal row. Here, for every vertex, there should be no ancestor of that vertex to the right of that vertex.

After arranging the vertices, let X be the sequence obtained by reading the numbers written on the vertices from left to right in the arrangement. Snuke would like to minimize the inversion number of X. Find the minimum possible inversion number of X.

Constraints

* 1 \leq N \leq 2 \times 10^5
* 1 \leq P_i < i ( 2 \leq i \leq N )
* 0 \leq V_i \leq 1 ( 1 \leq i \leq N )
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
P_2 P_3 ... P_N
V_1 V_2 ... V_N


Output

Print the minimum possible inversion number of X.

Examples

Input

6
1 1 2 3 3
0 1 1 0 0 0


Output

4


Input

1

0


Output

0


Input

15
1 2 3 2 5 6 2 2 9 10 1 12 13 12
1 1 1 0 1 1 0 0 1 0 0 1 1 0 0


Output

31

Solution (in CPP):

Solution:
#include<bits/stdc++.h>

using namespace std;

#define FOR(i, x, y) for(int i = (x); i < (y); ++i)
#define REP(i, x, y) for(int i = (x); i <= (y); ++i)
#define PB push_back
#define MP make_pair
#define PH push
#define fst first
#define snd second
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;

const int maxn = 2e5 + 5;

int n;
int fa[maxn], par[maxn];
ll ans = 0;

class Node{
public:
	int zero, one, u;
	Node(): zero(0), one(0), u(0){}
	inline bool operator < (const Node &oth)const{
		ll vl = 1ll * one * oth.zero, vr = 1ll * oth.one * zero;
		return MP(MP(vl, -zero), u) < MP(MP(vr, -oth.zero), oth.u);
	}
	inline Node& operator += (const Node &oth){ zero += oth.zero; one += oth.one; return *this; }
}a[maxn];

set<Node> que;

inline int find(int x){ return fa[x] == x ? x : fa[x] = find(fa[x]); }

inline void merge(int x, int y){
	a[y] += a[x];
	fa[x] = y;
	return;
}

int main(){
	scanf("%d", &n);
	FOR(i, 1, n){
		scanf("%d", par + i);
		--par[i];
	}
	FOR(i, 0, n){
		int x; scanf("%d", &x);
		if(!x)
			++a[i].zero;
		else
			++a[i].one;
		a[i].u = fa[i] = i;
		if(i)
			que.insert(a[i]);
	}
	
	while(que.size()){
		Node p = *que.begin(); que.erase(que.begin());
		int u = p.u, r = find(par[u]);
		if(r)
			que.erase(a[r]);
		ans += 1ll * a[r].one * a[u].zero;
		merge(u, r);
		if(r)
			que.insert(a[r]);
	}
	
	printf("%lld\n", ans);
	return 0;
}