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 = 1e5 + 5;

int n, m;
int a[N];
int par[N];
vector<int> vec[N];
vector<int> vals;
long long ans = 0;

int anc(int u) {
	return par[u] == u ? u : par[u] = anc(par[u]);
}

void join(int u,int v) {
	par[anc(v)] = anc(u);
}

int main() {
	ios_base::sync_with_stdio(false);
	cin >> n >> m;
	for (int i = 0; i < n; ++i) cin >> a[i];
	for (int i = 0; i < n; ++i) par[i] = i;
	for (int i = 0; i < m; ++i) {
		int u, v; cin >> u >> v;
		join(u, v);
	}
	int cnt = 0;
	for (int i = 0; i < n; ++i) {
		cnt += anc(i) == i;
		vec[anc(i)].push_back(a[i]);
	}
	if (cnt == 1) return cout << 0 << '\n',0;
	int choose = 2 * cnt - 2;
	for (int i = 0; i < n; ++i) if (anc(i) == i) {
		sort(vec[i].begin(), vec[i].end());
		ans += vec[i][0];
		choose--;
		for (int j = 1; j < vec[i].size(); ++j) {
			vals.push_back(vec[i][j]);
		}
	}
	if (choose > vals.size()) return cout << "Impossible\n",0;
	sort(vals.begin(), vals.end());
	for (int i = 0; i < choose; ++i) ans += vals[i];
	cout << ans << '\n';
}