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<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
#define MAXN 100000
#define INF 1100000000
#define LL long long
int a[MAXN+5];
bool vis[MAXN+5];
int n,m;
vector<int>G[MAXN+5];
int mina,p,cnt;
LL ans;
void DFS(int u,int fa)
{
	if(vis[u]) return;
	else vis[u]=1;
	if(a[u]<mina)
	{
		mina=a[u];
		p=u;
	}
	for(int i=0;i<G[u].size();i++)
	{
		int v=G[u][i];
		DFS(v,u);
	}
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++)
		scanf("%d",&a[i]);
	for(int i=0;i<m;i++)
	{
		int u,v;
		scanf("%d%d",&u,&v);
		G[u].push_back(v);
		G[v].push_back(u);
	}
	for(int i=0;i<n;i++)
		if(!vis[i])
		{
			mina=INF,p=-1,cnt++;
			DFS(i,-1);
			ans+=1LL*a[p];
			a[p]=INF;
		}
	if(cnt==1)
	{
		printf("0\n");
		return 0;
	}
	sort(a,a+n);
	for(int i=0;i<cnt-2;i++)
		if(a[i]==INF)
		{
			printf("Impossible\n");
			return 0;
		}
		else ans+=1LL*a[i];
	printf("%lld\n",ans);
}