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.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Set;

class Solver {

	class Component implements Comparable<Component> {
		PriorityQueue<Integer> pq = new PriorityQueue<Integer>();

		public int compareTo(Component o) {
			return pq.peek() - o.pq.peek();
		}
	};

	class Node {
		int ith = -1;
		int c;
		Set<Node> next = new HashSet<Node>();

		public Node(int i) {
			c = i;
		}

		public void dfs(Component g) {
			if (ith == -1) {
				ith = 1;
				g.pq.add(c);
				for (Node n : next)
					n.dfs(g);
			}
		}
	}

	public long components(int[] costs, int[][] edges) {
		Node[] nodes = new Node[costs.length];
		for (int i = 0; i < costs.length; i++)
			nodes[i] = new Node(costs[i]);

		for (int i = 0; i < edges.length; i++)
			for (int j = 0; j < edges[i].length; j++) {
				nodes[edges[i][0]].next.add(nodes[edges[i][1]]);
				nodes[edges[i][1]].next.add(nodes[edges[i][0]]);
			}

		List<Component> l = new ArrayList<Component>();
		for (int i = 0; i < costs.length; i++)
			if (nodes[i].ith == -1) {
				Component g = new Component();
				l.add(g);
				nodes[i].dfs(g);
			}
		long ans = 0;
		if (l.size() >= 2) {
			for (Component g : l)
				ans += g.pq.poll();
			if (l.size() > 2) {
				PriorityQueue<Component> pq = new PriorityQueue<Component>();
				// at least n-2
				for (int i = 0; i < l.size(); i++)
					if (!l.get(i).pq.isEmpty())
						pq.add(l.get(i));
				int cnt = l.size() - 2;
				while (!pq.isEmpty() && cnt-- > 0) {
					Component c = pq.poll();
					ans += c.pq.poll();
					if (!c.pq.isEmpty())
						pq.add(c);
				}
				if (cnt > 0)
					ans = -1;
			}

		}
		return ans;
	}
}

public class Main {

	InputStream is;
	PrintWriter out;
	String INPUT = "";
	long M = 1003;// 1000000007;

	void solve() {

		int t = 1;
		while (t-- > 0) {
			try {
				int n = ni();
				int m = ni();
				long ans = new Solver().components(na(n), na(m, 2));
				if (ans >= 0)
					System.out.println(ans);
				else
					System.out.println("Impossible");
			} catch (Exception e) {
				out.println(e.getMessage());
				throw e;
			}
		}
	}

	void run() throws Exception {
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);

		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if (!INPUT.isEmpty())
			tr(System.currentTimeMillis() - s + "ms");
	}

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

	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;

	private int readByte() {
		if (lenbuf == -1)
			throw new InputMismatchException();
		if (ptrbuf >= lenbuf) {
			ptrbuf = 0;
			try {
				lenbuf = is.read(inbuf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (lenbuf <= 0)
				return -1;
		}
		return inbuf[ptrbuf++];
	}

	private boolean isSpaceChar(int c) {
		return !(c >= 33 && c <= 126);
	}

	private int skip() {
		int b;
		while ((b = readByte()) != -1 && isSpaceChar(b))
			;
		return b;
	}

	private double nd() {
		return Double.parseDouble(ns());
	}

	private char nc() {
		return (char) skip();
	}

	private String ns() {
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != '
									// ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	private char[] ns(int n) {
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while (p < n) {
			if (!(isSpaceChar(b)))
				buf[p++] = (char) b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}

	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for (int i = 0; i < n; i++)
			map[i] = ns(m);
		return map;
	}

	private int[] na(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = ni();
		}
		return a;
	}

	private int[][] na(int n, int m) {
		int[][] a = new int[n][];
		for (int i = 0; i < n; i++)
			a[i] = na(m);
		return a;
	}

	private int ni() {
		int num = 0, b;
		boolean minus = false;
		while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
			;
		if (b == '-') {
			minus = true;
			b = readByte();
		}

		while (true) {
			if (b >= '0' && b <= '9') {
				num = num * 10 + (b - '0');
			} else {
				return minus ? -num : num;
			}
			b = readByte();
		}
	}

	private long nl() {
		long num = 0;
		int b;
		boolean minus = false;
		while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
			;
		if (b == '-') {
			minus = true;
			b = readByte();
		}

		while (true) {
			if (b >= '0' && b <= '9') {
				num = num * 10 + (b - '0');
			} else {
				return minus ? -num : num;
			}
			b = readByte();
		}
	}

	private static void tr(Object... o) {
		System.out.println(Arrays.deepToString(o));
	}
}
