Problem C
Appeal to the Audience
You are the director of the upcoming Bordfite Arena Progaming Competition. You have invited a bunch of players and are now setting up the matches for the knockout tournament that will determine the winner. As you may know, Bordfite Arena is a game that heavily rewards skill and very little luck is involved. This implies that whenever any number of players play a game of Bordfite Arena, the most skilled player will always win! Hence the winner of the tournament is already known, and you are a bit worried about this. How will you appease the audience?
You embark on a short quest to find out what the audience finds interesting. No surprises there: people find it most interesting when they see skillful players compete. Whenever a match is played, the happiness the audience gets from a match is the sum of the skill levels of the players. The total happiness the audience gets from the tournament is the sum of the happiness obtained during all matches. This is very useful information, because of course you want the audience to be as happy as possible at the end of the tournament.
Moreover, you invested some time to ask people what kind of knockout format they like. It turns out that instead of the plain old binary tree for the knockout schedule, they prefer a specific weirdlooking rooted tree, and so you decide to use that. This means the final step for you to complete is to divide the players over the leaves of the given tree so that over the entire tournament, the happiness of the audience is maximized.
Input

The first line contains integers $3\leq n\leq 10^5$ and $1 \leq k \leq n1$, the number of nodes of the tree and the number of players. The nodes are labelled $0$ through $n1$, and $0$ is the root of the tree.

The second line contains $k$ integers $0\leq a_1, \dots , a_ k\leq 10^9$, denoting the skill values of the players.

Then follow $n1$ lines, the $i$th of which ($1\leq i \leq n1$) contains the parent $0 \leq p_ i < i$ of node $i$.
It is guaranteed that the tree has exactly $k$ leaves and that there are no nodes with exactly one child.
Output

Output the maximal possible happiness the audience can obtain from this tournament.
Sample Input 1  Sample Output 1 

5 3 5 4 3 0 0 1 1 
17 
Sample Input 2  Sample Output 2 

11 7 30 5 15 1 3 100 50 0 0 1 0 2 5 2 5 5 1 
454 