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 heapq import heapify, heappop

N, M = map(int, input().split())
As = [(A, i) for i, A in enumerate(map(int, input().split()))]

if 2 * (N - M - 1) > N:
    print('Impossible')
    exit()
elif N - M == 1:
    print(0)
    exit()


def find(x):
    if parent[x] != x:
        parent[x] = find(parent[x])
    return parent[x]

def union(x, y):
    x = find(x)
    y = find(y)
    if x == y: return
    if rank[x] < rank[y]:
        parent[x] = y
    else:
        parent[y] = x
        if rank[x] == rank[y]:
            rank[x] += 1


parent = [i for i in range(N)]
rank = [0] * N

for i in range(M):
    x, y = map(int, input().split())
    union(x, y)

for i in range(N):
    find(i)

# 各々の木の中で、最小のaiを持つ頂点iを求める（辺の追加時に使用する）
minAs = {}
for A, i in As:
    p = parent[i]
    minAs[p] = min(minAs.get(p, (float('inf'), 0)), (A, i))

done = [False] * N
ans = 0
for (A, i) in minAs.values():
    done[i] = True
    ans += A

# 残りの頂点のうち、aiが小さい方から、(N - M - 2)個を選ぶ
heapify(As)
rest = N - M - 2
while rest > 0:
    A, i = heappop(As)
    if not done[i]:
        ans += A
        rest -= 1

print(ans)
