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

using namespace std;

const int maxn = 1e5 + 10;
int root[maxn];
int getroot(int x){
	return root[x] = root[x] == x ? x : getroot(root[x]);
}
int n , m;
int v[maxn] , who[maxn] , b[maxn];
bool use[maxn];
long long ans = 0;
int main(){
	ios::sync_with_stdio(0);
	cin >> n >> m;
	for(int i = 1 ; i <= n ; ++ i)
		cin >> v[i];
	for(int i = 1 ; i <= n ; ++ i)
		root[i] = i;
	for(int i = 1 ; i <= n ; ++ i)
		who[i] = i;
	for(int i = 1 ; i <= m ; ++ i){
		int s , t;
		cin >> s >> t;
		s ++; t ++;
		int s1 = getroot(s) , t1 = getroot(t);
		if(s1 == t1) continue;
		if(v[who[s1]] < v[who[t1]])
			who[t1] = who[s1];
		root[s1] = t1;
	}
	int cnt = 0;
	for(int i = 1 ; i <= n ; ++ i){
		int s = getroot(i);
		if(s == i){
			cnt ++; 
			ans += v[who[i]];
			use[who[i]] = 1;
		}
	}
	if((cnt - 1) * 2 > n)
		cout << "Impossible" << endl;
	else{
		if(cnt == 1){
			cout << 0 << endl;
			return 0;
		}
		int sum = 0;
		for(int i = 1 ; i <= n ; ++ i)
			if(!use[i]) b[++ sum] = v[i];
		sort(b + 1 , b + sum + 1);
		for(int i = 1 ; i < cnt - 1 ; ++ i)
			ans += b[i];
		cout << ans << endl;
	}
	return 0;
}