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>
#pragma GCC optimize("O3")
using namespace std;
#define ll long long 
#define pb push_back
//#define mp make_pair
#define fr first
#define sc second
#define N ((ll)(2e6+100))
#define MAX ((ll)(1e16+100))
#define ARRS ((ll)(3e5+100))
#define MOD ((ll)(1e9+7))
#define M1 ((ll)(1001783))
#define M2 ((ll)(1001941))
#define M3 ((ll)(1002073))
#define pb push_back


ll n,m;
ll a[ARRS];
ll pr[ARRS];
ll b[ARRS];
string s;
vector<ll> v[ARRS];
ll k,p,c,d,t;

ll par(ll x){
	if(pr[x]==x)return x;
	else return pr[x]=par(pr[x]);
}

void join(ll x,ll y){
	x=par(x);
	y=par(y);
	pr[y]=x;
}


int main(){
	cin>>n>>m;
	for(int i=0; i<n; i++)
		cin>>a[i],pr[i]=i;
	for(int j=0; j<m; j++){
		cin>>k>>p;
		join(k,p);
	}
	for(int i=0; i<n; i++)
		v[par(i)].pb(a[i]);
	ll pas=0;
	vector<ll> ka;
	for(int i=0; i<n; i++){
		if(par(i)==i){
			sort(v[i].begin(),v[i].end());
			pas+=v[i][0];
			for(int j=1; j<v[i].size(); j++)ka.pb(v[i][j]);
			c++;
			//cout<<pas<<" "<<c<<endl; 
		}
	}
	if(c==1){
		cout<<0<<endl;
		return 0;
	}
	sort(ka.begin(),ka.end());
	if(ka.size()<c-2){
		cout<<"Impossible";
		return 0;
	}
	for(int i=0; i<c-2; i++)pas+=ka[i];
	cout<<pas;
}
 
