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<iostream>
#include<cstdio>
#include<algorithm>
typedef long long ll;
const int N=1e5+5,INF=1e9+7;
int n,m,par[N],id[N],a[N];
void init(){
    for(int i=0;i<n;i++) par[i]=i,id[i]=i;
}
int fd(int x) {
    return par[x]==x?x:par[x]=fd(par[x]);
}
int main() {
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++) scanf("%d",a+i);init();
    int x,y;
    while(m--) {
        scanf("%d%d",&x,&y);
        x=fd(x);y=fd(y);
        if(x==y) continue;
        if(a[id[y]]>a[id[x]]) id[y]=id[x];
        par[x]=y;
    }
    ll ans=0;int tot=0;
    for(int i=0;i<n;i++) if(fd(i)==i) tot++,ans+=a[id[i]],a[id[i]]=INF;
    if(tot==1) printf("0\n");
    else {
        std::sort(a,a+n);bool ok=true;
        for(int i=0;i<tot-2;i++) {
            ans+=a[i];
            if(a[i]>=INF) ok=false;
        }
        if(ok) printf("%lld\n",ans);
        else printf("Impossible\n");
    }
    return 0;
}
