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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

/**
 * @author Pavel Mavrin
 */
public class Main {

    int[] p;

    int get(int x) {
        if (p[x] != x) p[x] = get(p[x]);
        return p[x];
    }


    private void solve() throws IOException {
        int n = nextInt();
        int m = nextInt();
        if (m == n - 1) {
            out.println(0);
            return;
        }
        int[] a = new int[n];
        p = new int[n];
        for (int i = 0; i < n; i++) p[i] = i;
        for (int i = 0; i < n; i++) a[i] = nextInt();
        for (int i = 0; i < m; i++) {
            int x = nextInt();
            int y = nextInt();
            p[get(x)] = get(y);
        }
        int[] min = new int[n];
        Arrays.fill(min, -1);
        for (int i = 0; i < n; i++) {
            int j = get(i);
            if (min[j] == -1 || a[min[j]] > a[i]) min[j] = i;
        }
        long s = 0;
        int k = (n - m - 1) * 2;
        for (int i = 0; i < n; i++) {
            if (p[i] == i) {
//                System.out.println(i + " " + a[min[i]]);
                s += a[min[i]];
                k--;
                a[min[i]] = Integer.MAX_VALUE;
            }
        }
        Arrays.sort(a);
        for (int i = 0; i < n; i++) {
            if (k == 0) break;
            if (a[i] == Integer.MAX_VALUE) {
                out.println("Impossible");
                return;
            }
            s += a[i];
            k--;
        }
        out.println(s);
    }

    // ------------------

    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st;
    PrintWriter out = new PrintWriter(System.out);

    String next() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    public static void main(String[] args) throws IOException {
        new Main().run();
    }

    private void run() throws IOException {
        solve();
        out.close();
    }

}
