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 pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define ll long long
int a[100001];
vector<int> nei[100001],con,lef;
bool vis[100001];
bool cmp(int x,int y){return a[x]<a[y];}
void dfs(int x){
	con.pb(x);
	vis[x]=true;
	for(int i=0;i<sz(nei[x]);i++){
		int to=nei[x][i];
		if(vis[to])continue;
		dfs(to);
	}
}
int main(){
	int n,m,i,j;scanf("%d%d",&n,&m);
	ll tot=0;
	if(n<2*(n-m-1))return !puts("Impossible");
	if(n-m==1)return !puts("0");
	for(i=1;i<=n;i++)scanf("%d",a+i);
	for(i=1;i<=m;i++){
		int x,y;scanf("%d%d",&x,&y);x++;y++;
		nei[x].pb(y);nei[y].pb(x);
	}
	for(i=1;i<=n;i++)if(!vis[i]){
		con.clear();
		dfs(i);
		int mn=0x7fffffff,mnid;
//		cout<<c<<". ";for(j=0;j<sz(con);j++)cout<<con[j]<<" ";puts("");
		for(j=0;j<sz(con);j++)if(a[con[j]]<mn)mn=a[con[j]],mnid=j;
		tot+=mn;
		for(j=0;j<sz(con);j++)if(j!=mnid)lef.pb(con[j]);
	}
//	cout<<sz(lef)<<"\n";
	if(n-m==2)return !printf("%lld\n",tot);
	sort(all(lef),cmp);
	for(i=0;i<n-m-2;i++)tot+=a[lef[i]];
	printf("%lld\n",tot);
	return 0;
}
/*1
7 5
1 2 3 4 5 6 7
3 0
4 0
1 2
1 3
5 6
*/
/*2
5 0
3 1 4 1 5
*/
/*3
1 0
5
*/