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
/* long long or int */
/* xx 396 */

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

const int MAX_N=1e5+10;
const int MAX_M=1e5+10;

int a[MAX_N],f[MAX_N];
vector <int> V[MAX_N],other;
int n,m,cnt=0;
ll ans=0;

int findset(int x){
	if(f[x]==x) return x;
	else return f[x]=findset(f[x]); 
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	for(int i=0;i<MAX_N;i++) f[i]=i;
	cin>>n>>m;
	for(int i=0;i<n;i++) cin>>a[i];
	for(int i=0;i<m;i++){
		int x,y; cin>>x>>y;
		int root_x=findset(x),root_y=findset(y);
		if(root_x!=root_y) f[root_x]=root_y;
	}
	for(int i=0;i<n;i++) if(f[i]==i) cnt++;
	if(cnt==1){
		cout<<0<<endl;
		return 0;
	}
	for(int i=0;i<n;i++){
		V[findset(i)].push_back(a[i]);
	}
	cnt=(cnt-1)*2;
	for(int i=0;i<n;i++){
		if(V[i].size()){
			sort(V[i].begin(),V[i].end());
			ans+=V[i][0]; cnt--;
			for(int j=1;j<V[i].size();j++) other.push_back(V[i][j]);
		}
	}
	if(cnt>other.size()){
		cout<<"Impossible"<<endl;
		return 0;
	}
	sort(other.begin(),other.end());
	for(int i=0;i<cnt;i++){
		ans+=other[i];
	}
	cout<<ans<<endl;
	return 0;
}