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 heappush, heappop, heapify, nsmallest

N, M = map(int, input().split())
costs = list(map(int, input().split()))
treemin = [(cost, i) for i, cost in enumerate(costs)] # グループ内での最小値

parent = list(range(N))
rank = [0] * (N)
def getRoot(x):
  if parent[x] == x:
    return x
  else:
    # ルートに繋ぎ変える
    parent[x] = getRoot(parent[x])
    return parent[x]

def unite(x, y):
  global treemin
  xRoot = getRoot(x)
  yRoot = getRoot(y)
  if xRoot == yRoot:
    return
  if rank[xRoot] < rank[yRoot]:
    parent[xRoot] = yRoot
    if treemin[yRoot][0] > treemin[xRoot][0]:
      treemin[yRoot] = treemin[xRoot]
  else:
    parent[yRoot] = xRoot
    if treemin[xRoot][0] > treemin[yRoot][0]:
      treemin[xRoot] = treemin[yRoot]
    if rank[xRoot] == rank[yRoot]:
      rank[xRoot] += 1

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

ans = 0
numtree = 0
exclude = set()
for i in range(N):
  if parent[i] == i:
    numtree += 1
    ans += treemin[i][0]
    exclude.add(treemin[i][1])

if N < (numtree-1) * 2:
  print('Impossible')
  exit()
if numtree == 1:
  print(0)
  exit()

heap = []
for i in range(N):
  if i not in exclude:
    heappush(heap, costs[i])

ans += sum(nsmallest(numtree - 2, heap))
print(ans)