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<vector>
#include<algorithm>
using namespace std;

int a[100001],f[100001];
int ff(int u){
	return f[u]==u?u:f[u]=ff(f[u]);
}
vector<int>g[100001];
int c[100001];
int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
		scanf("%d",&a[i]),
		f[i]=i;
	for(int i=1;i<=m;i++){
		int u,v;
		scanf("%d%d",&u,&v);
		u++;v++;
		f[ff(u)]=ff(v);
	}
	for(int i=1;i<=n;i++)
		g[ff(i)].push_back(a[i]);
	long long ans=0;
	int z=0;
	for(int i=1;i<=n;i++)
		if(i==ff(i)){
			z++;
			sort(g[i].begin(),g[i].end());
			ans+=g[i][0];
			for(int j=1;j<g[i].size();j++)
				c[++c[0]]=g[i][j];
		}
	if(z==1){
		printf("0\n");
		return 0;
	}
	if(c[0]<z-2){
		printf("Impossible\n");
		return 0;
	}
	sort(c+1,c+c[0]+1);
	for(int i=1;i<=z-2;i++)
		ans+=c[i];
	printf("%lld\n",ans);
}
