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 <bits/stdc++.h>
using namespace std;
int n, m;
int w[100020];
int v[100020];
vector<int> a[100020];
int bestvalue;
int bestindex;
long long ans;
void dfs(int x) {
	v[x] = 1;
	if (bestvalue > w[x]) {
		bestvalue = w[x];
		bestindex = x;
	}
	for (int i: a[x]) {
		if (!v[i]) {
			dfs(i);
		}
	}
}
int main() {
	scanf("%d%d", &n, &m);
	for (int i = 0; i < n; i++) {
		scanf("%d", &w[i]);
	}
	for (int i = 0; i < m; i++) {
		int x, y;
		scanf("%d%d", &x, &y);
		a[x].push_back(y);
		a[y].push_back(x);
	}
	int cnt = 0;
	for (int i = 0; i < n; i++) {
		if (!v[i]) {
			bestvalue = 2e9;
			bestindex = -1;
			dfs(i);
			cnt++;
			ans += bestvalue;
			w[bestindex] = 2e9;
		}
	}
	sort(w, w + n);
	if (cnt == 1) {
		printf("0\n");
		exit(0);
	}
	for (int i = 0; i < cnt - 2; i++) {
		if (w[i] == 2e9) {
			printf("Impossible\n");
			exit(0);
		}
		ans += w[i];
	}
	printf("%lld\n", ans);
	return 0;
}