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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            TaskD.Vertex[] v = new TaskD.Vertex[n];
            for (int i = 0; i < n; ++i) {
                v[i] = new TaskD.Vertex();
                v[i].a = in.nextInt();
            }
            for (int i = 0; i < m; ++i) {
                TaskD.Vertex a = v[in.nextInt()];
                TaskD.Vertex b = v[in.nextInt()];
                a.adj.add(b);
                b.adj.add(a);
            }
            int comps = 0;
            for (TaskD.Vertex vv : v) {
                if (vv.comp < 0) {
                    vv.dfs(comps++);
                }
            }
            if (comps != n - m) throw new RuntimeException();
            int need = 2 * (comps - 1);
            if (need == 0) {
                out.println(0);
                return;
            }
            Arrays.sort(v, new Comparator<TaskD.Vertex>() {

                public int compare(TaskD.Vertex o1, TaskD.Vertex o2) {
                    return Long.compare(o1.a, o2.a);
                }
            });
            int[] rem = new int[comps];
            Arrays.fill(rem, comps - 1);
            long res = 0;
            for (TaskD.Vertex vv : v) {
                if (rem[vv.comp] == comps - 1) {
                    --rem[vv.comp];
                    --need;
                    res += vv.a;
                    vv.comp = -1;
                }
            }
            for (TaskD.Vertex vv : v) {
                if (need == 0) break;
                if (vv.comp < 0) continue;
                if (rem[vv.comp] == 0) continue;
                --rem[vv.comp];
                --need;
                res += vv.a;
            }
            if (need == 0) out.println(res);
            else out.println("Impossible");
        }

        static class Vertex {
            int comp = -1;
            long a;
            List<TaskD.Vertex> adj = new ArrayList<>();

            public void dfs(int c) {
                comp = c;
                for (TaskD.Vertex v : adj) if (v.comp < 0) v.dfs(c);
            }

        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

    }
}

