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;

typedef long long ll;
const int MAXN = 100010;

inline int read() {
	int x = 0, f = 1;
	char ch = getchar();
	for(; !isdigit(ch); ch = getchar()) if(ch=='-') f=-1;
	for(; isdigit(ch); ch = getchar()) x = (x*10)+(ch^48);
	return x * f;
}

int n, m;
int a[MAXN], res;
int st[MAXN], to[MAXN<<1];
int nxt[MAXN<<1], e;
inline void Add(int u, int v) {
	to[++e] = v, nxt[e] = st[u];
	st[u] = e;
}

ll ans;
bool ban[MAXN], vis[MAXN];
int b[MAXN], cnt;

inline void dfs(int u) {
	int i;
	vis[u] = true;
	if(a[u] < a[res]) res = u;
	for(i = st[u]; i; i = nxt[i]) {
		int v = to[i];
		if(vis[v]) continue;
		dfs(v);
	}
}

int main() {

	int i;
	n = read(), m = read();
	if(m == n-1) {
		printf("0\n");
		return 0;
	}
	if(2*n-2*m-2 > n) {
		printf("Impossible\n");
		return 0;
	}
	generate(a+1, a+n+1, read);
	for(i = 1; i <= m; i++) {
		int u = read()+1, v = read()+1;
		Add(u, v), Add(v, u);
	}
	for(i = 1; i <= n; i++) 
		if(!vis[i]) {
			res = i, dfs(i);
			ban[res] = true, ans += a[res];
		}
	for(i = 1; i <= n; i++) 
		if(!ban[i]) b[++cnt] = a[i];
	sort(b+1, b+cnt+1);
	for(i = 1; i <= n-m-2; i++) ans += b[i];
	printf("%lld\n", ans);
	return 0;
}
