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 maxn=1e5+5;
int n,m;
int fa[maxn];
int find(int x){return (fa[x]==x ? x : fa[x]=find(fa[x]));}
int a[maxn];
vector<int>val[maxn];
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		fa[i]=i;
	}
	while(m--){
		int u,v;
		scanf("%d%d",&u,&v);
		u++;v++;
		fa[find(u)]=find(v);
	}
	for(int i=1;i<=n;i++){
		val[find(i)].push_back(a[i]);
	}
	int cnt=0;
	int pt=0,one=0;
	for(int i=1;i<=n;i++){
		sort(val[i].begin(),val[i].end());
		cnt+=(val[i].size()>0);
		if(val[i].size()>1)
			pt+=val[i].size()-1;
		if(val[i].size()==1)
			one++;
	}
	if(cnt==1){
		puts("0");
		return 0;
	}
	if(one>pt){
		puts("Impossible");
		return 0;
	}

	int sel=2*(cnt-1)-cnt;
	vector<int>num;
	long long ans=0;

	for(int i=1;i<=n;i++)if(val[i].size()){
		ans+=val[i][0];
		for(int j=1;j<val[i].size();j++){
			num.push_back(val[i][j]);
		}
	}
	sort(num.begin(),num.end());
	if(num.size()<sel){
		puts("Impossible");
		return 0;
	}
	for(int i=0;i<sel;i++){
		ans+=num[i];
	}

	cout<<ans<<endl;



	return 0;
}