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;
#define rep(i,n) for(int i=1;i<=n;i++)
#define N 100005
typedef long long ll;
int a[N],b[N],pp[N],minm[N],pos[N],n,m,tot,num;
bool vis[N];
ll ans;
int find(int x){return x==pp[x]?x:pp[x]=find(pp[x]);}
int main()
{
	scanf("%d%d",&n,&m);
	rep(i,n)pp[i]=i;
	rep(i,n)scanf("%d",&a[i]);
	int x,y;
	rep(i,m){
		scanf("%d%d",&x,&y),++x,++y;
		pp[find(x)]=find(y);
	}
	rep(i,n)minm[i]=1e9+1;
	rep(i,n){
		int u=find(i);
		if(!vis[u])num++;vis[u]=1;
		if(minm[u]>a[i]){pos[u]=i;minm[u]=a[i];}
	}
	rep(i,n){
		int u=find(i);
		if(pos[u]==i)ans+=a[i];
		else b[++tot]=a[i];
	}
	if(num==1){puts("0");return 0;}
	if(tot<num-2){puts("Impossible");return 0;}
	sort(b+1,b+tot+1);
	rep(i,num-2)ans+=b[i];
	printf("%lld\n",ans);
	return 0;
}