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 = [int(a) for a in input().split()]
X = [[] for _ in range(N)]
for _ in range(M):
    a, b = map(int, input().split())
    X[a].append(b)
    X[b].append(a)

def col(n, E):
    C = [-1] * n
    c = 0
    for i in range(N):
        if C[i] >= 0: continue
        Q = [i]
        C[i] = c
        while Q:
            x = Q.pop()
            for y in E[x]:
                if C[y] == -1:
                    C[y] = C[x]
                    Q.append(y)
        c += 1
    return C

C = col(N, X)
K = max(C) + 1

if N < 2*K-2:
    print("Impossible")
elif K == 1:
    print(0)
else:
    B = [-1] * K
    BB = []
    for i in range(N):
        if B[C[i]] < 0:
            B[C[i]] = A[i]
        else:
            if A[i] >= B[C[i]]:
                BB.append(A[i])
            else:
                BB.append(B[C[i]])
                B[C[i]] = A[i]
    BB = sorted(BB)
    
    print(sum(B + BB[:K-2]))