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>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;

ll n,m,a[100000],par[100000],x,y,MIN[100000];
ll ans;

ll root(ll x){return (x==par[x]?x:par[x]=root(par[x]));}

int main(){
    cin>>n>>m;
    if(n-1==m){
        cout<<0<<endl;
        return 0;
    }
    ll num=2*(n-m-1);
    if(n<num){
        cout<<"Impossible"<<endl;
        return 0;
    }
    rep(i,n)cin>>a[i],par[i]=i,MIN[i]=-1;
    rep(i,m){
        cin>>x>>y;
        if(root(x)!=root(y))par[root(y)]=root(x);
    }

    rep(i,n){
        if(MIN[root(i)]==-1)MIN[root(i)]=i;
        else if(a[MIN[root(i)]]>a[i])MIN[root(i)]=i;
    }
    rep(i,n){
        if(a[MIN[root(i)]]!=1e18){
            ans+=a[MIN[root(i)]];
            a[MIN[root(i)]]=1e18;
            num--;
        }
    }
    sort(a,a+n);
    rep(i,num)ans+=a[i];
    cout<<ans<<endl;
}