Problem Statement

Given is a tree with $N$ vertices numbered $1, \ldots, N$. The $i$-th edge connects Vertex $u_i$ and Vertex $v_i$. Additionally, Vertex $i$ has an integer $h_i$ written on it. We have $K$ pieces, the $i$-th of which is initially on Vertex $s_i$. You will repeat the following operation: choose a piece and move it to one of the vertices adjacent to the vertex the piece is currently on. You will end this process when each piece $i$ is on Vertex $t_i$. It is not required for each piece $i$ to go along the shortest path from Vertex $s_i$ to Vertex $t_i$. For an arrangement of the pieces, let its potential be the sum of the integers written on the vertices the pieces are on. If multiple pieces are on the same vertex, the integer on that vertex is added the number of times equal to that number of pieces. Find the minimum possible value of the maximum potential during the process, including the initial and final states.

Constraints

• $1 \leq N,K \leq 2000$
• $1 \leq u_i,v_i \leq N$
• $1 \leq h_i \leq 10^9$
• $1 \leq s_i,t_i \leq N$
• The given graph is a tree.

Input

Input is given from Standard Input in the following format:

N
h_1 h_2 \ldots h_N
u_1 v_1
u_2 v_2
:
u_{N-1} v_{N-1}
K
s_1 t_1
s_2 t_2
:
s_K t_K

Output

Print the answer.