In the recent years, sculptor Clark's works rank highly by more and more connoisseurs. Among Clark's works, "Art of balance" is the most famous one. The skeleton of the work is a combination of scales, as shown in the figure below. Being reputed as the masterpiece of contemporary sculptor, “Art of balance” shows the weight and value of human behaviors and potential views on the spiritual level and display a magic balance of their relationships. Unfortunately, due to some unexpected reasons, "Art of balance" was damaged in a fire disaster - the weights of these scales are all destroyed. In order to repair this treasure of art, some artists re-make these weights according to some existed records, but the scales cannot remain balance for some technical reasons and it needs some adjusting. Now you are asked to complete the job. To simplify the problem, we consider the skeleton as a binary tree. The leaves of the tree are where we should add weights. It is guaranteed that number of leaves equals the number of weights, and only one weight can be added to a leaf node. The weights of these weights are already known and all weights have the same appearance. At the beginning, the fulcrum of each scale is always at the middle of the rod, and each rod has a fixed length of 1000. When these weights were arranged to leaf nodes, the fulcrum should be adjusted according to the rule of torque balance so that the scale can remain stable. For each scale, let adjusted distance be the length of the line segment between the original fulcrum (i.e. the middle point) and the adjusted fulcrum. Your job is to find such an arrangement that minimize the sum of each scale's adjusted distance.

The first line contains an integer representing the number of test cases.
For each test case, the first line contains an integer representing the number of nodes N (3≤*N*≤100). Next *N* lines describe a tree. The nodes are numbered from 1 to *N*. If the *i*^{th} node is not a leaf node, the *i*^{th} line should contain two positive integers, which stand for the ID of *i*^{th} node’s left child and the ID of *i*^{th} node’s right child. Otherwise the *i*^{th} node is a leaf node and the *i*^{th} line should be "-1 -1". It is guaranteed that Node 1 will be the root of the tree. The following line contains an integer *M* representing the number of weights (2≤*M*≤16). Next line contains *M* positive integers standing for the value of these weights. The value of a single weight will not exceed 100.

For each test case, output a real number representing the minimum value of the sum of the adjusted distance, rounded to 0.001.