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;
int a[100005];
bool used[100005]={};
vector<int>edge[100005];
vector<int>cost[100005];
vector<int>G[100005];
int cnt=0;
void dfs(int x){
	used[x]=1;
	G[cnt].push_back(x);
	for(int i=0;i<edge[x].size();i++){
		if(!used[edge[x][i]]){
			dfs(edge[x][i]);
		}
	}
	return;
}
int main(){
	int n,m;
	cin>>n>>m;
	for(int i=0;i<n;i++)cin>>a[i];
	for(int i=0;i<m;i++){
		int u,v;
		cin>>u>>v;
		edge[u].push_back(v);
		edge[v].push_back(u);
	}
	for(int i=0;i<n;i++){
		if(!used[i]){
			dfs(i);
			cnt++;
		}
	}
	for(int i=0;i<cnt;i++){
		for(int j=0;j<G[i].size();j++){
			cost[i].push_back(a[G[i][j]]);
		}
	}
	if(cnt==1){
		cout<<"0"<<endl;
		return 0;
	}
	long long ans=0;
	vector<int>impossible;
	int ch=2*(cnt-1);
	for(int i=0;i<n;i++){
		if(cost[i].size()){
			sort(cost[i].begin(),cost[i].end());
			ans+=cost[i][0];
			ch--;
			for(int j=1;j<cost[i].size();j++){
				impossible.push_back(cost[i][j]);
			}
		}
	}
	if(ch>impossible.size()){
		cout<<"Impossible";
		return 0;
		
	}
	sort(impossible.begin(),impossible.end());
	for(int i=0;i<ch;i++)ans+=impossible[i];
	cout<<ans<<endl;
	return 0;
} 
