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 sd(x) scanf("%d",&x)
#define slld(x) scanf("%lld",&x)
#define ss(x) scanf("%s",x)
#define mod 1000000007
#define bitcount __builtin_popcountll
#define ll long long
#define pb push_back
#define pi pair<int,int>
#define pii pair<pi,int>
#define mp make_pair
int par[100005],a[100005],b[100005];
int findpar(int node)
{
	if(par[node]==node)
		return node;
	return par[node]=findpar(par[node]);
}
int main()
{
	int i,j,k;
	int n,m;
	sd(n);
	sd(m);
	for(i=0;i<n;i++)
	{
		par[i]=i;
		sd(a[i]);
		b[i]=a[i];
	}
	sort(b,b+n);
	int comp=n-m;
	comp=2*(comp-1);
	if(comp==0)
	{
		printf("0\n");
		return 0;
	}
	while(m--)
	{
		sd(i);
		sd(j);
		int x=findpar(i);
		int y=findpar(j);
		par[x]=y;
		a[y]=min(a[y],a[x]);
	}
	set<int>parents;
	multiset<int>s;
	for(i=0;i<n;i++)
		parents.insert(findpar(i));
	ll ans=0;
	for(auto it:parents)
	{
		ans+=a[it];
		comp--;
		s.insert(a[it]);
	}
	for(i=0;i<n&&comp>0;i++)
	{
		if(s.find(b[i])==s.end())
		{
			ans+=b[i];
			comp--;
		}
		else
			s.erase(s.find(b[i]));
	}
	if(comp)
	{
		printf("Impossible\n");
		return 0;
	}
	printf("%lld\n", ans);
	return 0;
}