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;

const int N = 100005;

int n, m, a[N], p[N], c;
vector<int> v;

int Find (int X) {
	if(p[X] == X) return X;
	return p[X] = Find(p[X]);
}

void Union (int A, int B) {
	A = Find(A);
	B = Find(B);
	if(a[A] > a[B]) swap(A, B);
	p[B] = A;
}

int main()
{
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++) {
		scanf("%d",&a[i]);
		p[i] = i;
	}
	for(int i=1;i<=m;i++) {
		int A, B;
		scanf("%d%d",&A,&B);
		Union(A, B);
	}
	long long ans = 0;
	for(int i=0;i<n;i++) {
		if(Find(i) != i) v.push_back(a[i]);
		else {
			ans += a[i];
			c++;
		}
	}
	if(c == 1) {
		puts("0");
		return 0;
	}
	sort(v.begin(), v.end());
	if((int)v.size() < c-2) {
		puts("Impossible");
		return 0;
	}
	for(int i=0;i<c-2;i++) {
		ans += v[i];
	}
	printf("%lld\n",ans);
}
