Petya and Tree

给定一棵二叉搜索树，包含 $n$ 个节点，保证每个节点只可能有 $0$ 或 $2$ 个子节点。 再给定 $k$ 次询问，每次询问给出一个值 $x_i$ ， 对于第 $i$ 次询问，将 $x_i$ 插入树中，在插入过程中会等概率的“走错”（即在到达某个点时如果该往左子树走，则该往右子树走，反之亦然）恰好一次，输出该节点插入后的父节点的权值的期望值。（询问之间相互独立，即不会真正插进去） tips： 二叉搜索树的定义：如果一棵二叉树满足其任意一节点中，左子树的所有点的权值均小于该点权值且右子树的所有点的权值均大于该点权值（忽略空子树），则这棵树被称为二叉搜索树。 二叉搜索树的插入操作：最初位于树根，如果当前节点的权值大于要插入的节点的权值，那么移动到该节点的右子节点，否则移动到该节点的左子节点并重复该过程直到该节点为空。 #### 输入格式翻译： 共 $n + k + 2$ 行，第一行一个奇数 $n$ ，表示树中节点的个数（$ 3 \leqslant n \leqslant 10^{5} $）。 后面 $n$ 行中第 $i + 1$ 行包含两个以空格分隔的整数，第一个数字是节点 $i$ 父节点的编号 $f_i$ $ ( 1 \leqslant f_i \leqslant n $，$f_i = -1$ 表示 $i$ 是根节点） ，第二个数字是节点 $i$ 的权值 $a_i$ $ ( 1 \leqslant a_i \leqslant 10^{9} )$ 。 下一行包含一个整数 $k$ $ ( 1 \leqslant k \leqslant 10^{5} )$，表示询问次数。后面 $k$ 行中第 $n + i + 1$ 行每行一个整数 $x_i$ $ ( 1 \leqslant x_i \leqslant 10^{9} )$，表示第 $i$ 次询问要插入的值。 保证所有 $x_i, a_i$ 均不相同，保证给出的二叉搜索树正确。 #### 输出格式翻译： 共 $n$ 行，第 $i$ 行有一个实数，表示第 $i$ 次询问的答案，如果该数与答案误差在 $10^{-9} $ 范围内，则被认为是正确的。

One night, having had a hard day at work, Petya saw a nightmare. There was a binary search tree in the dream. But it was not the actual tree that scared Petya. The horrifying thing was that Petya couldn't search for elements in this tree. Petya tried many times to choose key and look for it in the tree, and each time he arrived at a wrong place. Petya has been racking his brains for long, choosing keys many times, but the result was no better. But the moment before Petya would start to despair, he had an epiphany: every time he was looking for keys, the tree didn't have the key, and occured exactly one mistake. "That's not a problem!", thought Petya. "Why not count the expectation value of an element, which is found when I search for the key". The moment he was about to do just that, however, Petya suddenly woke up. Thus, you are given a binary search tree, that is a tree containing some number written in the node. This number is called the node key. The number of children of every node of the tree is equal either to $ 0 $ or to $ 2 $ . The nodes that have $ 0 $ children are called leaves and the nodes that have $ 2 $ children, are called inner. An inner node has the left child, that is the child whose key is less than the current node's key, and the right child, whose key is more than the current node's key. Also, a key of any node is strictly larger than all the keys of the left subtree of the node and strictly smaller than all the keys of the right subtree of the node. Also you are given a set of search keys, all of which are distinct and differ from the node keys contained in the tree. For each key from the set its search in the tree is realised. The search is arranged like this: initially we are located in the tree root, if the key of the current node is larger that our search key, then we move to the left child of the node, otherwise we go to the right child of the node and the process is repeated. As it is guaranteed that the search key is not contained in the tree, the search will always finish in some leaf. The key lying in the leaf is declared the search result. It is known for sure that during the search we make a mistake in comparing exactly once, that is we go the wrong way, but we won't make any mistakes later. All possible mistakes are equiprobable, that is we should consider all such searches where exactly one mistake occurs. Your task is to find the expectation (the average value) of the search result for every search key, considering that exactly one mistake occurs in the search. That is, for a set of paths containing exactly one mistake in the given key search, you should count the average value of keys containing in the leaves of those paths.

The first line contains an odd integer $ n $ ( $ 3<=n&lt;10^{5} $ ), which represents the number of tree nodes. Next $ n $ lines contain node descriptions. The $ (i+1) $ -th line contains two space-separated integers. The first number is the number of parent of the $ i $ -st node and the second number is the key lying in the $ i $ -th node. The next line contains an integer $ k $ ( $ 1<=k<=10^{5} $ ), which represents the number of keys for which you should count the average value of search results containing one mistake. Next $ k $ lines contain the actual keys, one key per line. All node keys and all search keys are positive integers, not exceeding $ 10^{9} $ . All $ n+k $ keys are distinct. All nodes are numbered from $ 1 $ to $ n $ . For the tree root "-1" (without the quote) will be given instead of the parent's node number. It is guaranteed that the correct binary search tree is given. For each node except for the root, it could be determined according to its key whether it is the left child or the right one.

Print $ k $ real numbers which are the expectations of answers for the keys specified in the input. The answer should differ from the correct one with the measure of absolute or relative error not exceeding $ 10^{-9} $ .

7
-1 8
1 4
1 12
2 2
2 6
3 10
3 14
1
1

8.0000000000

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

7.0000000000
7.0000000000
7.0000000000
3.0000000000
3.0000000000
3.0000000000

In the first sample the search of key 1 with one error results in two paths in the trees: (1, 2, 5) and (1, 3, 6), in parentheses are listed numbers of nodes from the root to a leaf. The keys in the leaves of those paths are equal to 6 and 10 correspondingly, that's why the answer is equal to 8.