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<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#define LL long long
#define PP std::pair<LL,int>
bool went[100010];
bool used[100010];
std::vector<int> G[100010];
LL a[100010];
LL ans;
int N, M;

void dfs(int s,LL &m,int &f) {
	went[s] = true;
	if (m > a[s]) {
		m = a[s];
		f = s;
	}
	for (auto u : G[s]) {
		if (!went[u]) {
			dfs(u,m,f);
		}
	}
}


int main() {
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cin >> N >> M;
	for (int i = 0; i < N; i++) {
		std::cin >> a[i];
	}
	
	for (int i = 0; i < M; i++) {
		int a, b;
		std::cin >> a >> b;
		G[a].emplace_back(b);
		G[b].emplace_back(a);
	}
	if (M == N - 1) {
		std::cout << 0 << std::endl;
		return 0;
	}
	if (N < 2 * (N - M - 1)) {
		std::cout << "Impossible" << std::endl;
		return 0;
	}
	for (int i = 0; i < N; i++) {
		if (!went[i]) {
			LL m = a[i];
			int f = i;
			dfs(i, m, f);
			used[f] = true;
			ans += m;
		}
	}
	std::vector<LL> S;
	for (int i = 0; i < N; i++) {
		if (!used[i])S.emplace_back(a[i]);
	}
	std::sort(S.begin(), S.end());
	for (int i = 0; i < N - M - 2; i++) {
		ans += S[i];
	}
	std::cout << ans << std::endl;
	return 0;
}
