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>
#define Maxn 100007
using namespace std;
inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
	while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int n,m;
int a[Maxn],b[Maxn],cnt=0;
int fa[Maxn],rk[Maxn],pos[Maxn];
bool flag[Maxn];
int find(int x)
{
	return fa[x]==x?x:fa[x]=find(fa[x]);
}
void mdf(int x,int y)
{
	x=find(x),y=find(y);
	if (x==y) return;
	if (rk[x]<rk[y]) swap(x,y);
	rk[x]+=rk[y];
	fa[y]=x;
	if (a[pos[y]]<a[pos[x]]) pos[x]=pos[y];
}
int main()
{
	n=read(),m=read();
	if (m==n-1)
	{
		printf("%d\n",0);
		return 0;
	}
	if (n<2*(n-m-1))
	{
		printf("Impossible\n");
		return 0;
	}
	for (int i=1;i<=n;i++)
		a[i]=read();
	for (int i=1;i<=n;i++)
		fa[i]=i,rk[i]=1,pos[i]=i;
	for (int i=1;i<=m;i++)
	{
		int a=read()+1,b=read()+1;
		mdf(a,b);
	}
	long long ans=0;
	int tot=0;
	for (int i=1;i<=n;i++)
		if (!flag[pos[find(i)]])
		{
			ans+=a[pos[find(i)]];
			++tot;
			flag[pos[find(i)]]=true;
		}
	for (int i=1;i<=n;i++)
		if (!flag[i]) b[++cnt]=a[i];
	sort(b+1,b+cnt+1);
	for (int i=1;i<=cnt;i++)
		if (tot<2*(n-m-1))
		{
			++tot;
			ans+=b[i];
		}
	printf("%lld\n",ans);
	return 0;
}
