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
#include <cstdio>
#include <algorithm>

typedef long long int lli;

const int MAXN = 100004;
const lli INF = 1e18;

int N, M;
int d1[MAXN];
int fm[MAXN];
int uf[MAXN];

int find(int p) {
  if (uf[p] == p) return p;
  return uf[p] = find(uf[p]);
}

int main() {
  scanf("%d %d", &N, &M);

  const int g = N - M;
  if (g == 1) {
    puts("0");
    return 0;
  } else if ((g - 1) * 2 > N) {
    puts("Impossible");
    return 0;
  }

  for (int i = 0; i < N; ++i) {
    uf[i] = i;
    fm[i] = -1;
    scanf("%d", &d1[i]);
  }
  for (int i = 0; i < M; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    const int xx = find(x);
    const int yy = find(y);
    if (xx != yy) uf[xx] = yy;
  }

  for (int i = 0; i < N; ++i) {
    const int ig = find(i);
    if (fm[ig] == -1 || d1[fm[ig]] > d1[i]) {
      fm[ig] = i;
    }
  }

  lli ans = 0;
  int cc = 0;
  for (int i = 0; i < N; ++i) {
    if (fm[i] == -1) continue;
    ans += d1[fm[i]];
    d1[fm[i]] = 1000000004;
  }
  std::sort(d1, d1 + N);
  for (int i = 0; i < g-2; ++i) {
    ans += d1[i];
  }

  printf("%lld\n", ans);
  return 0;
}
