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 For(i, j, k) for(int i = j; i <= k; i++)

using namespace std;

const int N = 1e5 + 10;

int A[N];

struct cmp{
	bool operator () (int x, int y){
		return A[x] > A[y];
	}
};

priority_queue<int, vector<int>, cmp> q;
int n, m;

int fa[N];
int find(int x){
	return x == fa[x] ? x : fa[x] = find(fa[x]);
}

bool vis[N];

int main(){

	scanf("%d%d", &n, &m);

	if(n == m + 1){
		puts("0");
		return 0;
	}
		
	For(i, 1, n) scanf("%d", &A[i]), fa[i] = i;
	For(i, 1, n) q.push(i);
	For(i, 1, m){
		int u, v;
		scanf("%d%d", &u, &v);
		++u, ++v;
		fa[find(u)] = find(v);
	}

	long long ans = 0;
	int s = n - m - 2, cnt = 0;

	while(!q.empty()){
		int i = q.top(), o = find(i); q.pop();
		if(vis[o] && cnt < s) ++cnt, ans += A[i];
		else if(!vis[o]) vis[o] = true, ans += A[i];
	}
	
	if(cnt == s) printf("%lld\n", ans);
	else puts("Impossible");

	return 0;
}