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;

#define SZ(x) ((int)x.size())

const int N = 100005;

int n, m;
int a[N];
int fa[N];

vector<int> val[N];

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

void merge(int x, int y) {
	x = getfa(x);
	y = getfa(y);
	if(SZ(val[x]) < SZ(val[y])) {
		swap(x, y);
	}
	for(auto v: val[y]) {
		val[x].push_back(v);
	}
	val[y].clear();
	fa[y] = x;
}

void input()
{
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);

		val[i].push_back(a[i]);
		fa[i] = i;
	}
	for(int i = 1; i <= m; i++) {
		int x, y;
		scanf("%d%d", &x, &y);
		x++, y++;
		merge(x, y);
	}
}

void solve()
{
	long long ans = 0;

	int cnt = (n - 1 - m) * 2;

	if(cnt == 0) {
		puts("0");
		return;
	}

	vector<int> vec;
	for(int i = 1; i <= n; i++) {
		if(fa[i] == i) {
			sort(val[i].begin(), val[i].end());
			ans += val[i][0];
			cnt--;
			for(int j = 1; j < SZ(val[i]); j++) {
				vec.push_back(val[i][j]);
			}
		}
	}

	if(SZ(vec) < cnt) {
		puts("Impossible");
		return;
	}

	sort(vec.begin(), vec.end());
	for(int i = 0; i < cnt; i++) {
		ans += vec[i];
	}
	cout << ans << endl;
}

int main()
{
	input();
	solve();

	return 0;
}
