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
N,M=map(int,input().split())
if N-1==M:
  print(0)
  exit()
A=[int(a) for a in input().split()]
G=[[] for i in range(N)]
inf=float("inf")
for i in range(M):
  a,b=map(int,input().split())
  G[a].append(b)
  G[b].append(a)
Tree=[-1]*N

def BFS(x,n):
  global Tree
  stack=deque([x])
  while stack:
    a=stack.popleft()
    Tree[a]=n
    for b in G[a]:
      if Tree[b]<0:
        stack.append(b)
n=0
for i in range(N):
  if Tree[i]<0:
    BFS(i,n)
    n+=1
    
P=[inf]*n
for i in range(N):
  P[Tree[i]]=min(P[Tree[i]],A[i])
P.sort()
ans=sum(P)
P.append(inf)
k=0
A.sort()
for i in range(N):
  if A[i]==P[k]:
    A[i]=inf
    k+=1
A.sort()
if 2*(N-M-1)-n>=N or n>2*(N-M-1) or N-2*(N-M-1)<0:
  print("Impossible")
  exit()
for i in range(2*(N-M-1)-n):
  ans+=A[i]
if ans!=inf:
  print(ans)
    
  
  