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 ll long long
using namespace std;

int n, m, aim, fa[101000], a[101000], id[101000], die[101000], sz[101000];
ll ans;

int GF(int x){
  return x==fa[x]? x: fa[x]=GF(fa[x]);
}

bool cmp(int x,int y){
  return a[x]<a[y];
}

int main(){
  cin>>n>>m; aim=(n-1-m)*2;
  for (int i=1;i<=n;++i) scanf("%d",&a[fa[i]=id[i]=i]);
  sort(id+1,id+n+1,cmp);
  int x, y, las=aim;
  for (;m--;){
    scanf("%d%d",&x,&y); ++x; ++y;
    fa[GF(x)]=GF(y);
  }
  for (int i=1;i<=n&&las;++i){
    x=id[i];
    if (sz[GF(x)]) continue;
    die[x]=1; ++sz[GF(x)]; ans+=a[x]; --las;
  }
  for (int i=1;i<=n&&las;++i){
    x=id[i];
    if (die[x]||(sz[GF(x)]+1)*2>aim) continue;
    die[x]=1; ++sz[GF(x)]; ans+=a[x]; --las;
  }
  if (las) return 0*puts("Impossible");
  cout<<ans<<endl;
}