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.Arrays;
import java.util.PriorityQueue;
import java.util.Scanner;

class Main {
	class DJSet {
		int n;
		int[] upper;

		public DJSet(int n_) {
			n = n_;
			upper = new int[n];
			Arrays.fill(upper, -1);
		}

		int root(int x) {
			return upper[x] < 0 ? x : (upper[x] = root(upper[x]));
		}

		void setUnion(int x, int y) {
			x = root(x);
			y = root(y);
			if (x == y)
				return;
			if (upper[x] < upper[y]) {
				x ^= y;
				y ^= x;
				x ^= y;
			}
			upper[y] += upper[x];
			upper[x] = y;
		}

		int cmpNum() {
			int ret = 0;
			boolean[] vis = new boolean[n];
			for (int i = 0; i < n; ++i) {
				if (vis[root(i)])
					continue;
				else {
					vis[root(i)] = true;
					++ret;
				}
			}
			return ret;
		}
	}

	@SuppressWarnings("unchecked")
	public void run() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int[] a = new int[n];
		for (int i = 0; i < n; ++i) {
			a[i] = sc.nextInt();
		}
		DJSet ds = new DJSet(n);
		int cnt = 2 * (n - 1);
		int[] x = new int[m];
		int[] y = new int[m];
		boolean[] vis = new boolean[n];
		long[][] tmp = new long[n][2];
		for (int i = 0; i < tmp.length; ++i)
			for (int j = 0; j < tmp[i].length; ++j)
				tmp[i][j] = Integer.MAX_VALUE / 2;
		for (int i = 0; i < m; ++i) {
			x[i] = sc.nextInt();
			y[i] = sc.nextInt();
			ds.setUnion(x[i], y[i]);
			cnt -= 2;
		}
		if (cnt > n) {
			System.out.println("Impossible");
			return;
		}
		for (int i = 0; i < n; ++i) {
			tmp[ds.root(i)][0] = Math.min(tmp[ds.root(i)][0], a[i]);
			if (tmp[ds.root(i)][0] == a[i])
				tmp[ds.root(i)][1] = i;
		}
		long ans = 0;
		if (cnt > 0) {
			for (int i = 0; i < n; ++i) {
				if (tmp[i][0] == Integer.MAX_VALUE / 2)
					continue;
				ans += tmp[i][0];
				vis[(int) tmp[i][1]] = true;
				--cnt;
			}
		}
		PriorityQueue<Integer> pq = new PriorityQueue();
		for (int i = 0; i < n; ++i) {
			if (vis[i])
				continue;
			pq.add(a[i]);
		}
		while (cnt-- > 0) {
			ans += pq.poll();
		}
		System.out.println(ans);
	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

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