You are given a forest with N vertices and M edges. The vertices are numbered 0 through N-1. The edges are given in the format (x_i,y_i), which means that Vertex x_i and y_i are connected by an edge.

Each vertex i has a value a_i. You want to add edges in the given forest so that the forest becomes connected. To add an edge, you choose two different vertices i and j, then span an edge between i and j. This operation costs a_i + a_j dollars, and afterward neither Vertex i nor j can be selected again.

Find the minimum total cost required to make the forest connected, or print `Impossible` if it is impossible.

Constraints

* 1 ≤ N ≤ 100,000
* 0 ≤ M ≤ N-1
* 1 ≤ a_i ≤ 10^9
* 0 ≤ x_i,y_i ≤ N-1
* The given graph is a forest.
* All input values are integers.

Input

Input is given from Standard Input in the following format:


N M
a_0 a_1 .. a_{N-1}
x_1 y_1
x_2 y_2
:
x_M y_M


Output

Print the minimum total cost required to make the forest connected, or print `Impossible` if it is impossible.

Examples

Input

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


Output

7


Input

5 0
3 1 4 1 5


Output

Impossible


Input

1 0
5


Output

0
from collections import deque
import sys


def dfs(adj, start, visited, cost):
    que = deque()
    que.append(start)
    cost_list = []
    while que:
        v = que.pop()
        visited[v] = 1
        cost_list.append(cost[v])
        for u in adj[v]:
            if visited[u] == 0:
                que.append(u)
    visited_ret = visited
    return sorted(cost_list), visited_ret


N, M = map(int, input().split())
cost = list(map(int, input().split()))
adj = [[] for _ in range(N)]
for _ in range(M):
    a, b = map(int, input().split())
    adj[a].append(b)
    adj[b].append(a)

visited = [0] * N
cost_lists = []
for i in range(N):
    if visited[i] == 0:
        cost_list, visited = dfs(adj, i, visited, cost)
        cost_lists.append(cost_list)

if len(cost_lists) == 1:
    print(0)
    sys.exit()

ans = 0
pool = []
for i, cost_list in enumerate(cost_lists):
    for j, cost in enumerate(cost_list):
        if j == 0:
            ans += cost
        else:
            pool.append(cost)
pool.sort()
for i in range(len(cost_lists) - 2):
    if i < len(pool):
        ans += pool[i]
    else:
        print('Impossible')
        sys.exit()
print(ans)
