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 <map>
#include <algorithm>

using namespace std;

int root[100000];
int getRoot(int v){ return root[v] == -1 ? v : root[v] = getRoot(root[v]); }

int main(){
	int N, M;
	while(cin >> N >> M){
		fill(root, root+N, -1);
		vector<int> a(N);
		for(int& t : a) cin >> t;
		for(int i=0;i<M;i++){
			int x, y; cin >> x >> y;
			int p = getRoot(x);
			int q = getRoot(y);
			if(p != q) root[q] = p;
		}
		map<int, int> id;
		for(int i=0;i<N;i++){
			int p = getRoot(i);
			if(!id.count(p)){
				int size = id.size();
				id[p] = size;
			}
		}
		if(id.size() == 1){
			cout << 0 << endl;
			continue;
		}
		vector<vector<int>> v(id.size());
		for(int i=0;i<N;i++){
			v[id[getRoot(i)]].push_back(a[i]);
		}
		for(auto& vec : v) sort(vec.begin(), vec.end());
		long long res = 0;
		vector<int> all;
		for(const auto& vec : v){
			res += vec[0];
			for(int i=1;i<vec.size();i++) all.push_back(vec[i]);
		}
		if(all.size() < (int)v.size()-2){
			cout << "Impossible" << endl;
			continue;
		}
		sort(all.begin(), all.end());
		for(int i=0;i<(int)v.size()-2;i++) res += all[i];
		cout << res << endl;
	}
}
