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>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
const int MX = 100005;
int n, m, a, p[MX], t, c, x, y, cnt;
bool used[MX];
ll ans;
queue<int> qu;
P pa[MX];
int find(int x){return (p[x] < 0 ? x : p[x] = find(p[x]));}
void uni(int x, int y){
	x = find(x); y = find(y);
	if(x != y){
		if(p[x] > p[y]) swap(x, y);
		p[x] += p[y];
		p[y] = x;
		cnt--;
	}
}
int main(){
	scanf("%d%d", &n, &m);
	rep(i,n){
		scanf("%d", &a);
		pa[i] = P(a,i);
	}
	fill(p,p+n,-1);
	cnt = n-2;
	rep(i,m){
		scanf("%d%d", &x, &y);
		uni(x,y);
	}
	if(cnt == -1) return 0*puts("0");
	sort(pa,pa+n);
	rep(i,n){
		tie(a,t) = pa[i];
		t = find(t);
		if(!used[t]){
			ans += a;
			used[t] = true;
		}else if(c < cnt){
			ans += a;
			c++;
		}
	}
	if(c < cnt) puts("Impossible");
	else printf("%lld\n", ans);
}