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 n,m,a[200000],p[200000];
vector<int> v[200000],u;
int find(int x){return p[x]==x?x:p[x]=find(p[x]);}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++)scanf("%d",a+i),p[i]=i;
	for(int i=0;i<m;i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		p[find(x)]=find(y);
	}
	for(int i=0;i<n;i++)v[find(i)].push_back(a[i]);
	long long ans=0,cnt=0;
	for(int i=0;i<n;i++)
		if(!v[i].empty())
		{
			cnt++;
			sort(v[i].begin(),v[i].end());
			ans+=v[i].front();
			for(int j=1;j<v[i].size();j++)u.push_back(v[i][j]);
		}
	if(cnt==1){puts("0");return 0;}
	sort(u.begin(),u.end());
	for(int i=0;i<2*(n-m-1)-cnt;i++)
		if(u.size()<=i){puts("Impossible");return 0;}
		else ans+=u[i];
	printf("%lld\n",ans);
	return 0;
}