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;
typedef long long ll;
const int maxn=1e5+10;
int n,m,u,v;
int fa[maxn];
set<int> st;
struct Node{
	ll val;
	int id;
} node[maxn];
bool cmp(Node a,Node b){return a.val<b.val;}
int find(int x){return x==fa[x]? x:fa[x]=find(fa[x]);}
void merge(int x,int y)
{
	int fx=find(x),fy=find(y);
	if(fx!=fy) fa[fx]=fy;
}

int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i) scanf("%lld",&node[i].val),node[i].id=fa[i]=i;
	for(int i=1;i<=m;++i) scanf("%d%d",&u,&v),merge(u+1,v+1);
	for(int i=1;i<=n;++i) st.insert(find(i));
	sort(node+1,node+1+n,cmp);
	int len=st.size(),cnt=0;
	ll ans=0;
	if(n==1 || m==n-1) { puts("0"); return 0;}
	if(2*(len-1)>n) puts("Impossible");
	else
	{
		for(int i=1;i<=n;++i)
		{
			if(st.find(fa[node[i].id]) != st.end()) ans+=1ll*node[i].val,st.erase(fa[node[i].id]);
			else
			{
				if(++cnt<len-1) ans+=1ll*node[i].val;
			}
		}
		printf("%lld\n",ans);
	}

	return 0;
 } 