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
import sys

def wantp(n):

    wpq = []
    while n != p[n]:
        wpq.append(n)
        n = p[n]

    for i in wpq:
        p[i] = n

    return n


N , M = map(int,input().split())

a = list(map(int,input().split()))


p = [i for i in range(N)]
rank = [1] * N

dic = {}

ans = 0

for i in range(M):

    x,y = map(int,input().split())

    xp = wantp(x)
    yp = wantp(y)

    if xp != yp:

        if rank[xp] < rank[yp]:
            p[xp] = yp
        elif rank[xp] > rank[yp]:
            p[yp] = xp
        else:
            p[yp] = xp
            rank[yp] += 1

for i in range(N):

    now = i
    np = wantp(now)

    if np not in dic:
        dic[np] = []

    dic[np].append(a[i])

    """

    if np not in dic:
        dic[np] = [float("inf"),float("inf"),float("inf")]

    if dic[np][1] > a[i]:
        dic[np][2] = dic[np][1]
        dic[np][1] = a[i]

    elif dic[np][2] > a[i]:
        dic[np][2] = a[i]

    if dic[np][2] == float("inf"):
        dic[np][0] = dic[np][1]
    else:
        dic[np][0] = dic[np][1] + dic[np][2]

    """



ans = 0
able = []
#print(dic)

for i in dic:
    dic[i].sort()
    ans += dic[i][0]

    for j in range(len(dic[i])-1):
        able.append(dic[i][j+1])
    

able.sort()

if len(dic) == 1:
    print (0)
    sys.exit()

elif len(dic) - 1 > N // 2:
    print ("Impossible")
    sys.exit()

for i in range(len(dic)-2):

    ans += able[i]

print (ans)

    
