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
def dfs(i):
    global ns,flags,a
    if flags[i]:
        return []
    flags[i]=True
    out=[a[i]]
    for n in ns[i]:
        out.extend(dfs(n))
    return out
        

line=input().split()
N=int(line[0])
M=int(line[1])
a=input().split()
ns={}
for i in range(N):
    a[i]=int(a[i])
    ns[i]=[]


for i in range(M):
    line=input().split()
    x=int(line[0])
    y=int(line[1])
    ns[x].append(y)
    ns[y].append(x)

flags=[False for i in range(N)]
sets=[]
for i in range(N):
    if not flags[i]:
        sets.append(dfs(i))

if len(sets)==1:
    print ("0")
    exit(0)
if (len(sets)-1)*2>N:
    print ("Impossible")
    exit(0)

        
tot=0
for s in sets:
    s.sort()
    tot+=s[0]
more=(len(sets)-1)*2-len(sets)
al=[]
for s in sets:
    for p in s[1:]:
        al.append(p)
al.sort()
for i in range(more):
    tot+=al[i]
print(tot)
