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 <queue>

using namespace std;

typedef pair<int,int> pii;

const int N=100010;

struct node{
	node *ls,*rs;
	int val;
}b[N],*rt[N];

int n,m,fa[N],a[N];

int getfa(int x){
	return x==fa[x]?x:fa[x]=getfa(fa[x]);
}

inline int ran(){
	static int x=31253125; x+=(x<<4)+5; return x&65536;
}

node *Merge(node *x,node *y){
	if(!x || !y) return !x?y:x;
	if(x->val>y->val) swap(x,y);
	ran()?x->ls=Merge(x->ls,y):x->rs=Merge(x->rs,y);
	return x;
}

priority_queue<pii> Q;

int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) 
		scanf("%d",&a[i]),rt[i]=b+i,rt[i]->val=a[i],fa[i]=i;
	for(int i=1;i<=m;i++){
		int x,y; scanf("%d%d",&x,&y); x++; y++;
		x=getfa(x); y=getfa(y);
		if(x==y) continue;
		rt[x]=Merge(rt[x],rt[y]);
		fa[y]=x;
	}
	int cnt=0; long long ans=0;
	node *c; c=0;
	for(int i=1;i<=n;i++)
		if(getfa(i)==i){
			cnt++; ans+=rt[i]->val;
			rt[i]=Merge(rt[i]->ls,rt[i]->rs);
			c=Merge(c,rt[i]);
		}
	if(cnt==1) return puts("0"),0;
	int cur=0;
	while(c && cur<cnt-2){
		ans+=c->val; c=Merge(c->ls,c->rs); cur++;
	}
	if(cur==cnt-2) printf("%lld\n",ans);
	else puts("Impossible");
	return 0;
}