Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

F. Ehab and a weird weight formula

time limit per test

2.5 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou're given a tree consisting of $$$n$$$ nodes. Every node $$$u$$$ has a weight $$$a_u$$$. It is guaranteed that there is only one node with minimum weight in the tree. For every node $$$u$$$ (except for the node with the minimum weight), it must have a neighbor $$$v$$$ such that $$$a_v<a_u$$$. You should construct a tree to minimize the weight $$$w$$$ calculated as follows:

- For every node $$$u$$$, $$$deg_u \cdot a_u$$$ is added to $$$w$$$ ($$$deg_u$$$ is the number of edges containing node $$$u$$$).
- For every edge $$$\{ u,v \}$$$, $$$\lceil log_2(dist(u,v)) \rceil \cdot min(a_u,a_v)$$$ is added to $$$w$$$, where $$$dist(u,v)$$$ is the number of edges in the path from $$$u$$$ to $$$v$$$ in the given tree.

Input

The first line contains the integer $$$n$$$ $$$(2 \le n \le 5 \cdot 10^5)$$$, the number of nodes in the tree.

The second line contains $$$n$$$ space-separated integers $$$a_1, a_2, \ldots, a_n$$$ $$$(1 \le a_i \le 10^9)$$$, the weights of the nodes.

The next $$$n-1$$$ lines, each contains 2 space-separated integers $$$u$$$ and $$$v$$$ $$$(1 \le u,v \le n)$$$ which means there's an edge between $$$u$$$ and $$$v$$$.

Output

Output one integer, the minimum possible value for $$$w$$$.

Examples

Input

3

1 2 3

1 2

1 3

Output

7

Input

5

4 5 3 7 8

1 2

1 3

3 4

4 5

Output

40

Note

In the first sample, the tree itself minimizes the value of $$$w$$$.

In the second sample, the optimal tree is:

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/15/2019 03:27:58 (e2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|