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>
typedef long long ll;
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
using namespace std;
const ll MAX_N=1e5;
ll N,M,a[MAX_N],g;
vector<ll> vec[MAX_N],G[MAX_N];
bool used[MAX_N];
void dfs(ll v,ll g){
	used[v]=true;
	vec[g].push_back(a[v]);
	for(auto e:G[v]){
		if(!used[e]){
			dfs(e,g);
		}
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>N>>M;
	REP(i,N)cin>>a[i];
	REP(i,M){
		ll x,y;
		cin>>x>>y;
		G[x].push_back(y);
		G[y].push_back(x);
	}
	g=0;
	REP(v,N){
		if(!used[v]){
			dfs(v,g++);
		}
	}
	if(N>=2*(g-1)){
		if(g==1){
			cout<<0<<endl;
		}else{
			ll ans=0;
			vector<ll> vs;
			REP(i,g){
				sort(vec[i].begin(),vec[i].end());
				ans+=vec[i][0];
				REP(j,vec[i].size()-1){
					vs.push_back(vec[i][j+1]);
				}
			}
			sort(vs.begin(),vs.end());
			REP(i,g-2){
				ans+=vs[i];
			}
			cout<<ans<<endl;
		}
	}else{
		cout<<"Impossible"<<endl;
	}
}