Problem: 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:
    
    
      
    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.

Input

The first line determines the number of vertices in the graph n (1 ≤ n ≤ 105). The next n - 1 lines contain pairs of integers ai and bi, which show the existence of an edge between ai and bi vertices (1 ≤ ai, bi ≤ n). It is guaranteed that the given graph is a tree.

Next n lines contain pairs of non-negative numbers xi and yi, 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 <image> and <image> correspondingly. The sum of all xi and the sum of all yi are positive and do not exceed 106.

Output

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

Examples

Input

2
1 2
0 1
1 0


Output

1.00000000000000000000


Input

3
1 2
1 3
1 0
0 2
0 3


Output

2.00000000000000000000


Input

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


Output

4.04081632653

Note

In the first sample the entrance vertex is always 1 and the exit vertex is always 2.

In the second sample the entrance vertex is always 1 and the exit vertex with the probability of 2/5 will be 2 of with the probability if 3/5 will be 3. The mathematical expectations for the exit vertices 2 and 3 will be equal (symmetrical cases). During the first move one can go to the exit vertex with the probability of 0.5 or to go to a vertex that's not the exit vertex with the probability of 0.5. In the first case the number of moves equals 1, in the second one it equals 3. The total mathematical expectation is counted as 2 / 5 × (1 × 0.5 + 3 × 0.5) + 3 / 5 × (1 × 0.5 + 3 × 0.5)

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INF64 = 1e18;
inline char nc() {
  static char buf[100005], *p1 = buf, *p2 = buf;
  return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
             ? EOF
             : *p1++;
}
inline int read() {
  char ch = nc();
  int sum = 0;
  int f = 0;
  while (!isdigit(ch)) f |= (ch == '-'), ch = nc();
  while (isdigit(ch)) sum = (sum << 1) + (sum << 3) + (ch ^ 48), ch = nc();
  return f ? -sum : sum;
}
const int maxn = 1e5 + 5;
int n, suma, sumb;
double a[maxn], b[maxn];
namespace Graph {
struct Node {
  int to;
  int next;
} edge[maxn << 1];
int head[maxn], cnt;
inline void add_edge(int x, int y) {
  edge[++cnt].next = head[x];
  edge[cnt].to = y;
  head[x] = cnt;
}
}  // namespace Graph
using namespace Graph;
int siz[maxn], f[maxn];
double sum[maxn];
inline void dfs(int x, int fa) {
  siz[x] = 1;
  f[x] = fa;
  sum[x] = a[x];
  for (int i = head[x]; i != 0; i = edge[i].next) {
    int k = edge[i].to;
    if (k == fa) continue;
    dfs(k, x);
    siz[x] += siz[k];
    sum[x] += sum[k];
  }
}
double ans;
int main() {
  n = read();
  for (int i = 1; i < n; i++) {
    int x, y;
    x = read();
    y = read();
    add_edge(x, y);
    add_edge(y, x);
  }
  for (int i = 1; i <= n; i++)
    a[i] = read(), b[i] = read(), suma += a[i], sumb += b[i];
  for (int i = 1; i <= n; i++)
    a[i] = 1.0 * a[i] / suma, b[i] = 1.0 * b[i] / sumb;
  dfs(1, 0);
  for (int x = 1; x <= n; x++) {
    for (int i = head[x]; i != 0; i = edge[i].next) {
      int k = edge[i].to;
      if (k == f[x])
        ans += (1 - sum[x]) * (n - siz[x]) * b[x];
      else
        ans += sum[k] * siz[k] * b[x];
    }
  }
  printf("%.11lf\n", ans);
  return 0;
}