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<stdio.h>
#include<algorithm>
using namespace std;
typedef long long ll;
int h[100010],nex[200010],to[200010],M;
void add(int a,int b){
	M++;
	to[M]=b;
	nex[M]=h[a];
	h[a]=M;
}
bool vis[100010];
int v[100010],p[100010],pa[100010],ma;
void dfs(int x){
	if(vis[x])return;
	vis[x]=1;
	p[++M]=v[x];
	for(int i=h[x];i;i=nex[i])dfs(to[i]);
}
int main(){
	int n,m,i,j,x,y,cnt;
	ll ans;
	scanf("%d%d",&n,&m);
	if(2*(n-m-1)>n){
		puts("Impossible");
		return 0;
	}
	ans=0;
	cnt=2*(n-m-1);
	for(i=1;i<=n;i++)scanf("%d",v+i);
	while(m--){
		scanf("%d%d",&x,&y);
		x++;
		y++;
		add(x,y);
		add(y,x);
	}
	for(i=1;i<=n&&cnt;i++){
		if(!vis[i]){
			M=0;
			dfs(i);
			sort(p+1,p+M+1);
			ans+=p[1];
			for(j=2;j<=M;j++)pa[++ma]=p[j];
			cnt--;
		}
	}
	sort(pa+1,pa+ma+1);
	for(i=1;i<=cnt;i++)ans+=pa[i];
	printf("%lld",ans);
}