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
class UnionFind:
    def __init__(self,n):
        self.ps = [-1]*n
    def find(self,x):
        if self.ps[x]<0:
            return x
        else:
            self.ps[x]=self.find(self.ps[x])
            return self.ps[x]
    def unite(self,x,y):
        x=self.find(x)
        y=self.find(y)
        if x==y:
            return False
        if self.ps[x]>self.ps[y]:
            x,y = y,x
        self.ps[x] += self.ps[y]
        self.ps[y] = x
        return True
    def same(self,x,y):
        return self.find(x)==self.find(y)
    def size(self,x):
        x = self.find(x)
        return -self.ps[x]

def main():
  n,m = map(int, input().split())
  a = list(map(int, input().split()))
  uf = UnionFind(n)
  for _ in range(m):
    x,y = map(int, input().split())
    uf.unite(x,y)
  d = dict()
  res = list()
  for i in range(n):
    v = uf.find(i)
    if v not in d:
      d[v] = a[i]
    elif d[v] > a[i]:
      res.append(d[v])
      d[v] = a[i]
    else:
      res.append(a[i])
  t = len(d)
  e = (t-1)*2
  if t == 1:
    return 0
  elif len(res) < e-t:
    return 'Impossible'
  else:
    res.sort()
    return sum(x for x in d.values()) + sum(res[:e-t])
  
print(main())