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 {
    private static final int INF = Integer.MAX_VALUE;

    public class MinCost {
        int id, cost;

        public MinCost(int id, int cost) {
            this.id = id;
            this.cost = cost;
        }
    }

    public class Node {
        int root, cost;

        public Node(int id, int cost) {
            this.root = id;
            this.cost = cost;
        }
    }

    public void main(Scanner sc) {
        int n = sc.nextInt();
        int m = sc.nextInt();

        Node nodes[] = new Node[n];
        for (int i = 0; i < n; i++) {
            nodes[i] = new Node(i, sc.nextInt());
        }
        for (int i = 0; i < m; i++) {
            link(sc.nextInt(), sc.nextInt(), nodes);
        }
        sc.close();

        if (n - 1 == m) {
            System.out.println(0);
            return;
        } else if (n < 2 * (n - m - 1)) {
            System.out.println("Impossible");
            return;
        }

        Map<Integer, MinCost> map = new HashMap<>();
        for (int i = 0; i < n; i++) {
            Node node = root(i, nodes);
            int root = node.root;
            if (!map.containsKey(root) || (map.get(root).cost > nodes[i].cost)) {
                map.put(root, new MinCost(i, nodes[i].cost));
            }
        }

        long ans = 0;
        for (Map.Entry<Integer, MinCost> entry : map.entrySet()) {
            MinCost minCost = entry.getValue();
            ans += minCost.cost;
            nodes[minCost.id].cost = INF;
        }

        int cnt = 2 * (n - m - 1) - map.size();
        Arrays.sort(nodes, (o1, o2) -> o1.cost - o2.cost);
        for (int i = 0; i < cnt; i++) {
            ans += nodes[i].cost;
        }

        System.out.println(ans);
    }

    private void link(int src, int dst, Node node[]) {
        node[root(dst, node).root].root = root(src, node).root;
    }

    private Node root(int n, Node node[]) {
        int rootn = node[n].root;
        if (rootn != n) {
            node[n].root = root(rootn, node).root;
        }

        return node[n];
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        new Main().main(sc);
    }
}
