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 ll long long 
const int N=1e5+100;
typedef pair<int,int>pii;
int f[N],a[N];
int find(int x)
{
	return x==f[x]?x:f[x]=find(f[x]);
}
priority_queue<pii,vector<pii>,greater<pii> >q[N];
vector<int>v;
int main()
{
	int n,m;
	cin>>n>>m;
	for(int i=0;i<n;i++) cin>>a[i],f[i]=i;
	f[n]=n;
	for(int i=1,x,y;i<=m;i++)
	{
		cin>>x>>y;
		f[find(x)]=find(y);
	}
	ll ans=0;
	for(int i=0;i<n;i++)
	 q[find(i)].push({a[i],i});
	for(int i=0;i<n;i++)
	{
		if(q[i].size())
		{
			v.push_back(i);
			ans+=q[i].top().first;
			a[q[i].top().second]=2e9;
		}
	}
	if(v.size()==1) cout<<0<<endl; 
	else if(n<2*(v.size()-1)) cout << "Impossible" << endl;
	else
	{
		sort(a,a+n);
		n=v.size()-2;
		for(int i=0;i<n;i++)
		 ans+=a[i];
		cout<<ans<<endl;
	}
	return 0;
}