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 debug(...) fprintf(stderr,__VA_ARGS__)
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long LL;
const int MAXN=1e5 +10;

vector<int> G[MAXN];
int n, a[MAXN],m;
bool vis[MAXN], flag[MAXN];
int DFS(int u){
	vis[u] = true;
	int res= u;
	for (int i=0; i<G[u].size(); i++)
		if ( !vis[G[u][i]]){
			int nx= DFS(G[u][i]);
			if ( a[nx] < a[res]) res=nx;
		}
	return res;
}
int main(){

	scanf("%d%d", &n, &m);
	for (int i=0; i<n ; i++) scanf("%d", &a[i]);
	for (int i=0, u,v; i<m; i++){
		scanf("%d%d", &u, &v);
		G[u].PB(v); G[v].PB(u);
	}
	int c=0;
	
	for (int u=0; u<n ; u++)
		if ( !vis[u]){
			flag[ DFS(u)] = true;
			c++;
		}
	if ( c==1){
		printf("0\n");
		return 0;
	}
	vector<int> co;
	LL ans=0;
	for (int i=0;i <n; i++) if ( !flag[i]) co.PB(a[i]);	else ans+=a[i];
	#ifdef che
	debug("initial ans= %lld , co.size()=%d c=%d\n", ans, co.size(),c);
	#endif
	if ( co.size() <c-2)	printf("Impossible\n");
		else{
			sort(co.begin(), co.end());
			for (int i=0; i<c-2; i++) ans+=co[i];
			printf("%lld\n", ans);
		}
	return 0;
}
