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 <vector>
#include <algorithm>
using namespace std;

long long n, m, a[100009], b[100009], e[100009], col[100009], cnts; bool used[100009]; vector<long long>x[100009], G[100009];

void dfs(int pos) {
	if (col[pos] >= 1) return;
	col[pos] = cnts; G[cnts].push_back(pos);
	for (int i = 0; i < x[pos].size(); i++) dfs(x[pos][i]);
}

int main() {
	cin >> n >> m;
	for (int i = 0; i < n; i++) cin >> e[i];
	for (int i = 1; i <= m; i++) {
		cin >> a[i] >> b[i];
		x[a[i]].push_back(b[i]);
		x[b[i]].push_back(a[i]);
	}
	for (int i = 0; i < n; i++) {
		if (col[i] >= 1) continue;
		cnts++; dfs(i);
	}
	if (cnts == 1) { cout << "0" << endl; return 0; }
	long long sum = 0;
	for (int i = 1; i <= cnts; i++) {
		long long minx = (1LL << 60), minid = 0;
		for (int j = 0; j < G[i].size(); j++) {
			if (e[G[i][j]] < minx) { minx = e[G[i][j]]; minid = G[i][j]; }
		}
		sum += minx; used[minid] = true;
	}
	vector<long long>F;
	for (int i = 0; i < n; i++) {
		if (used[i] == false) F.push_back(e[i]);
	}
	if (F.size() < cnts - 2) {
		cout << "Impossible" << endl;
		return 0;
	}
	sort(F.begin(), F.end());
	for (int i = 0; i < cnts - 2; i++) sum += F[i];
	cout << sum << endl;
	return 0;
}