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.InputStreamReader;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Queue;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] sa = br.readLine().split(" ");
		int n = Integer.parseInt(sa[0]);
		int m = Integer.parseInt(sa[1]);
		sa = br.readLine().split(" ");
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = Integer.parseInt(sa[i]);
		}
		List<List<Integer>> list = new ArrayList<>(n);
		for (int i = 0; i < n; i++) {
			list.add(new ArrayList<>());
		}
		for (int i = 0; i < m; i++) {
			sa = br.readLine().split(" ");
			int x = Integer.parseInt(sa[0]);
			int y = Integer.parseInt(sa[1]);
			list.get(x).add(y);
			list.get(y).add(x);
		}
		br.close();

		int use = 2 * (n - 1 - m);
		if (use == 0) {
			System.out.println(0);
		} else if (use > n) {
			System.out.println("Impossible");
		} else {
			long ans = 0;
			boolean[] used = new boolean[n];
			boolean[] visit = new boolean[n];
			for (int i = 0; i < n; i++) {
				if (!visit[i]) {
					int min = Integer.MAX_VALUE;
					int idx = -1;
					Queue<Integer> que = new ArrayDeque<>();
					que.add(i);
					visit[i] = true;
					while (!que.isEmpty()) {
						int cur = que.poll();
						if (a[cur] < min) {
							min = a[cur];
							idx = cur;
						}
						for (int next : list.get(cur)) {
							if (!visit[next]) {
								que.add(next);
								visit[next] = true;
							}
						}
					}
					used[idx] = true;
					ans += min;
				}
			}
			PriorityQueue<Integer> que = new PriorityQueue<>();
			int cnt = 0;
			for (int i = 0; i < n; i++) {
				if (used[i]) {
					cnt++;
				} else {
					que.add(a[i]);
				}
			}
			for (int i = 0; i < use - cnt; i++) {
				ans += que.poll();
			}
			System.out.println(ans);
		}
	}
}
