Problem M
Trade Routes

All roads lead to Rome. In this case, we mean every road in the road network in the Roman Empire can be travelled in only one direction. Each city that is not Rome has exactly one road that leaves it and by following these roads, you will always end up in Rome.

Each city, including Rome itself, may create a trade route to Rome which brings Rome some value. These values are all distinct. Each city does not want to be too congested with traders so they constrain the number of trade routes that the city can be a part of.

We say that a city is part of a trade route if it is contained in the unique path from the city that created the trade route and Rome. A city is a part of its own trade route.

Given the city constraints, determine the maximum value that can be brought to Rome by choosing a subset of cities to create trade routes.

Input

The first line of input contains a single integer $N$ ($2 \leq N \leq 300\, 000$), which is the number of cities. The cities are numbered $1$ to $N$. Rome is city number $1$.

The next line contains $N-1$ integers $p_2, p_3, \ldots , p_{N}$ ($1 \leq p_ i < i$), where $p_ i$ is the city you reach by following the single road out of city $i$.

The next line contains $N$ integers $b_1, b_2, \ldots , b_{N}$ ($0 \leq b_ i \leq N$), where $b_ i$ is the maximum number of trade routes that city $i$ can be a part of.

The next line contains $N$ distinct integers $v_1, v_2, \ldots , v_ N$ ($0 \leq v_ i \leq 10^9$), which is the value brought to Rome if city $i$ creates a trade route.

Output

First display the maximum possible value Rome can receive from any valid subset of chosen trade routes. Next display $T$, the number of trade routes created, then display the $T$ cities, in increasing order, that were selected.

If there are multiple possible solutions, display any of them.

7
1 1 2 2 3 3
2 1 2 1 1 1 1
6 5 3 8 4 7 1

15
2 4 6

9
1 1 2 3 3 4 4 4
4 4 2 4 1 0 1 1 1
100 30 10 0 50 200 12 15 13

195
4 1 2 5 8