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;
class dsu
{
	public:
	vector<int> p;
	int n;
	dsu(int _n):n( _n)
	{
		p.resize(n);
		iota(p.begin(),p.end(),0);
	}
	inline int get(int x)
	{
		return (x==p[x]?x:(p[x]=get(p[x])));
	}
	inline bool unite(int x,int y)
	{
		x=get(x);
		y=get(y);
		if(x!=y)
		{
			p[x]=y;
			return true;
		}
		return false;
	}
};
int main()
{
	int n,m;
	cin>>n>>m;
	vector<int> a(n);
	for (int i=0;i<n;i++)
	{
		cin>>a[i];
	}
	dsu d(n);
	for(int i=0;i<m;i++)
	{
		int x,y;
		cin>>x>>y;
		d.unite(x,y);
	}
	vector< vector<int> > comp(n);
	for(int i=0;i<n;i++)
	{
		comp[d.get(i)].push_back(a[i]);
	}
	int cnt=0;
	for(int i=0;i<n;i++)
	{
		if(!comp[i].empty())
		{
			cnt++;
		}
	}
	if(cnt==1)
	{
		cout<<"0";
		return 0;
	}
	int choose=2*cnt-2;
	long long ans=0;
	vector<int> other;
	for(int i=0;i<n;i++)
	if(!comp[i].empty()) 
	{
		sort(comp[i].begin(),comp[i].end());
		ans+=comp[i][0];
		choose--;
		for(int j=1;j<(int) comp[i].size();j++)
		{
			other.push_back(comp[i][j]);
		}
	}
	if(choose>(int) other.size())
	{
		puts("Impossible");
		return 0;
	}
	sort(other.begin(),other.end());
	for(int i=0;i<choose;i++)
	{
		ans+=other[i];
	} 
	cout<<ans<<endl;
	return 0;
} 