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 defaultdict
import sys
sys.setrecursionlimit(10 ** 6)
N, M = map(int, input().split())
if N - 1 == M:
    print(0)
    exit()
if N < 2 * (N - M - 1):
    print('Impossible')
    exit()


parent = [i for i in range(N)]
rank = [0] * N


def find(i):
    if parent[i] == i:
        return i
    else:
        parent[i] = find(parent[i])
        return parent[i]


def same(x, y):
    return find(x) == find(y)


def unite(x, y):
    x = find(x)
    y = find(y)
    if x == y:
        return

    if rank[x] > rank[y]:
        parent[y] = x
    else:
        parent[x] = y
        if rank[x] == rank[y]:
            rank[y] += 1


A = list(map(int, input().split()))
G = [[] for i in range(N)]
X, Y = [], []
for i in range(M):
    x, y = map(int, input().split())
    X.append(x)
    Y.append(y)
    unite(x, y)

K = 0
D = defaultdict(list)
for i in range(N):
    k = find(i)
    if not D[k]:
        K += 1
    D[k].append((A[i], i))

ans = 0
used = [0] * N
for v in D.values():
    s = min(v)
    ans += s[0]
    used[s[1]] = 1

T = []
for i in range(N):
    if not used[i]:
        T.append(A[i])

T = sorted(T)
ans += sum(T[:2 * (N - M - 1) - K])
print(ans)
