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
import java.util.*;

public class Main{
    
    static int n;
    static int m;
    static ArrayList<Integer>[] g;
    static boolean[] used;
    static int[] cmp;
    static ArrayList<Integer>[] cos;
    
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        
        n = sc.nextInt();
        m = sc.nextInt();
        
        g = new ArrayList[n];
        for(int i=0; i<n; i++){
            g[i]= new ArrayList<Integer>();
        }
        
        used = new boolean[n];
        cmp = new int[n];
        
        int[] a = new int[n];
        for(int i=0; i<n; i++){
            a[i] = sc.nextInt();
        }
        
        for(int i=0; i<m; i++){
            int x = sc.nextInt();
            int y = sc.nextInt();
            addEdge(x, y);
        }
        
        int k = scc();
        
        cos = new ArrayList[k];
        for(int i=0; i<k; i++){
            cos[i] = new ArrayList<Integer>();
        }
        
        for(int i=0; i<n; i++){
            cos[cmp[i]].add(a[i]);
        }
        
        if(k==1){
            System.out.println(0);
            return;
        }
        
        long cost = 0;
        
        ArrayList<Integer> nkr = new ArrayList<Integer>();
        for(int i=0; i<k; i++){
            Collections.sort(cos[i]);
            cost += cos[i].get(0);
            for(int j=1; j<cos[i].size(); j++){
                nkr.add(cos[i].get(j));
            }
        }
        
        int pick = k-2;
        if(nkr.size() < pick){
            System.out.println("Impossible");
            
        }else{
            Collections.sort(nkr);
            
            for(int i=0; i<pick; i++){
                cost += nkr.get(i);
            }
            
            System.out.println(cost);
        }
    }
    
    public static int scc(){
        usedReset();
        
        int k =0;
        for(int i=0; i<n; i++){
            if(!used[i]) dfs(i, k++);
        }
        
        return k;
    }
    
    
    public static void usedReset(){
        Arrays.fill(used, false);
    }
    
    public static void addEdge(int from, int to){
        g[from].add(to);
        g[to].add(from);
    }
    
    public static void dfs(int v, int k){
        used[v] = true;
        cmp[v] = k;
        for(int i=0; i<g[v].size(); i++){
            if(!used[(int)g[v].get(i)]) dfs((int)g[v].get(i), k);
        }
    }
    
}
