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
N,M=map(int, input().split())
A=list(map(int, input().split()))
if N-1==M:
  print(0)
  exit()
#連結成分の合計a,連結する辺の数b
a,b=N-M,N-M-1
if N<2*(N-M-1):
  print('Impossible')
  exit()

par=[i for i in range(N)]
rank=[0]*(N)
size=[1]*N

def find(x):
  if par[x]==x:
    return x
  else:
    par[x]=find(par[x])
    return par[x]
def same(x,y):
  return find(x)==find(y)
def union(x,y):
  x=find(x)
  y=find(y)
  if x==y:
    return 
  if rank[x]>rank[y]:
    par[y]=x
    size[x]+=size[y]
  else:
    par[x]=y
    size[y]+=size[x]
    if rank[x]==rank[y]:
      rank[y]+=1
      
for i in range(M):
  a,b=map(int,input().split())
  union(a,b)
D=[[10**9+1,-1] for i in range(N)]
C=[]
for i in range(N):
  a=find(i)
  if D[a][0]>A[i]:
    C.append([D[a][0],D[a][1]])
    D[a][0]=A[i]
    D[a][1]=i
  else:
    C.append([A[i],i])
ans=0
cnt=0
for a,b in D:
  if b!=-1:
    ans+=a
    cnt+=1
C=sorted(C)
for a,b in C:
  if cnt==2*(N-M-1):
    break
  ans+=a
  cnt+=1
print(ans)