A8335 | Maze

A maze is represented by a tree (an undirected graph, where exactly one way exists between each pair of vertices). In the maze the entrance vertex and the exit vertex are chosen with some probability. The exit from the maze is sought by Deep First Search. If there are several possible ways to move, the move is chosen equiprobably. Consider the following pseudo-code:

```plain
DFS(x)
if x == exit vertex then
finish search
flag[x] <- TRUE
random shuffle the vertices' order in V(x) // here all permutations have equal probability to be chosen
for i <- 1 to length[V] do
if flag[V[i]] = FALSE then
count++;
DFS(y);
count++;
```

$V(x)$ is the list vertices adjacent to $x$ . The $flag$ array is initially filled as FALSE. $DFS$ initially starts with a parameter of an entrance vertex. When the search is finished, variable $count$ will contain the number of moves.

Your task is to count the mathematical expectation of the number of moves one has to do to exit the maze.

The first line determines the number of vertices in the graph $n$ ( $1<=n<=10^{5}$ ). The next $n-1$ lines contain pairs of integers $a_{i}$ and $b_{i}$ , which show the existence of an edge between $a_{i}$ and $b_{i}$ vertices ( $1<=a_{i},b_{i}<=n$ ). It is guaranteed that the given graph is a tree.

Next $n$ lines contain pairs of non-negative numbers $x_{i}$ and $y_{i}$ , which represent the probability of choosing the $i$ -th vertex as an entrance and exit correspondingly. The probabilities to choose vertex $i$ as an entrance and an exit equal  and  correspondingly. The sum of all $x_{i}$ and the sum of all $y_{i}$ are positive and do not exceed $10^{6}$ .

Print the expectation of the number of moves. The absolute or relative error should not exceed $10^{-9}$ .