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<set>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
int a[100010],fa[100010],N,M,x,y,cnt,now[100010],size[100010],p;
long long ans;
int read()
{
	static int x;
	static char ch;
	x = 0;
	for(ch=getchar();ch>'9'||ch<'0';ch=getchar());
	for(;ch>='0'&&ch<='9';ch=getchar()) x = x * 10 + ch - '0';
	return x;
}
int find(int x)
{
	return x == fa[x] ? x : fa[x] = find(fa[x]);
}
bool cmp(int x,int y)
{
	return a[x] < a[y];
}
void solve()
{
	for (int i = 1;i<=N;++i) now[i] = i,size[fa[i]]++;
	sort(now+1,now+1+N,cmp); 
	p = N;
	cnt*=2;
	for (int i = N;i>=1 && p>cnt;--i) if (size[fa[now[i]]] > 1) ans-=a[now[i]],size[fa[now[i]]]--,p--;
	cout << ans << endl;
}
int main()
{
	N = read();M = read();
	for (int i = 1;i<=N;++i) a[i] = read(),fa[i]=i,ans+=a[i];
	for (int i = 1;i<=M;++i) 
	{
		x = read() + 1;y = read() + 1;
		fa[find(x)] = find(y);
	}
	for (int i = 1;i<=N;++i) if(find(i)==i) ++cnt;
	cnt--;
	if (cnt>(N>>1)) puts("Impossible");
	else if (!cnt) puts("0");
	else solve();
	return 0;
}