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;
bool vis[N]={};int n,m,a[N],cnt,head[N];
struct Edge {
    int to,nxt;
}edge[N<<1];
void init() {
    for(int i=0;i<n;i++) head[i]=-1,vis[i]=false;cnt=0;
}
void addEdge(int from,int to) {
    edge[cnt].to=to;edge[cnt].nxt=head[from];head[from]=cnt++;
}
int dfs(int u) {
    vis[u]=true;int res=u,tmp;
    for(int i=head[u];~i;i=edge[i].nxt) {
        int v=edge[i].to;
        if(vis[v]) continue;
        tmp=dfs(v);
        if(a[tmp]<a[res]) res=tmp;
    }
    return res;
}
int main() {
    scanf("%d%d",&n,&m);init();int u,v;
    for(int i=0;i<n;i++) scanf("%d",a+i);
    while(m--) {
        scanf("%d%d",&u,&v);
        addEdge(u,v);addEdge(v,u);
    }
    ll ans=0;int cnt=0;
    for(int i=0;i<n;i++) {
        if(vis[i]) continue;
        cnt++;u=dfs(i);
        ans+=a[u];a[u]=INF;
    }
    if(cnt==1) {
        printf("0\n");
        return 0;
    }
    std::sort(a,a+n);
    for(int i=0;i<cnt-2;i++) {
        if(a[i]>=INF) {
            printf("Impossible\n");
            return 0;
        }
        ans+=a[i];
    }
    printf("%lld\n",ans);
    return 0;
}
