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.*;
import java.util.*;
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);
        TaskE solver = new TaskE();
        solver.solve(1, in, out);
        out.flush();out.close();
    }
        static class TaskE {
         int p[],R[];
         void f(int u){
          if(p[u]==u)return;
          f(p[u]);
          p[u]=p[p[u]];
         }
         void m(int u,int v){
          f(u);f(v);
          int pu=p[u],pv=p[v];
          if(pu==pv)return;
          if(R[pu]==R[pv])++R[pu];
          if(R[pu]<R[pv])p[pu]=pv;
          else p[pv]=pu;
         }
         class pair{
          int id,pi,val;pair(int a,int b,int c){id=a;pi=b;val=c;}
         }
         public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n=in.nextInt(),m=in.nextInt();
            int a[]=new int[n];p=new int[n];R=new int[n];
            for(int i=0;i<n;i++){
             a[i]=in.nextInt();p[i]=i;
            }
            for(int i=0;i<m;i++){
             int u=in.nextInt(),v=in.nextInt();
             m(u,v);
            }
            HashSet<Integer> hs=new HashSet<>();
            ArrayList<Integer> al[]=new ArrayList[n];
            for(int i=0;i<n;i++)al[i]=new ArrayList<>();
            for(int i=0;i<n;i++){
             f(i);
             hs.add(p[i]);al[p[i]].add(a[i]);
            }
            if(hs.size()==1){
             out.print("0");return;
            }
            long ans=0;ArrayList<Integer> cu=new ArrayList<>();int T=hs.size();
            for(int i=0;i<n;i++){
             Collections.sort(al[i]);
             if(al[i].size()==0)continue;
             ans+=(long)al[i].get(0);
             for(int j=1;j<al[i].size();j++)cu.add(al[i].get(j));
            }
            if(cu.size()<T-2){
             out.print("Impossible");return;
            }
            Collections.sort(cu);
            for(int i=0;i<T-2;i++)ans+=(long)cu.get(i);
            out.print(ans);
         }
    }
        /*
7 3
1 2 3 4 5 6 7
3 4
1 2
1 5
        */
    static class InputReader {
        BufferedReader br;
        StringTokenizer st;
        public InputReader(InputStream stream) {
            br = new BufferedReader(new InputStreamReader(stream));
            st = null;
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                String s = null;
                try {
                    s = br.readLine();
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (s == null)
                    return null;
                st = new StringTokenizer(s);
            }
            return st.nextToken();
        }

        boolean hasMoreTokens() {
            while (st == null || !st.hasMoreTokens()) {
                String s = null;
                try {
                    s = br.readLine();
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (s == null)
                    return false;
                st = new StringTokenizer(s);
            }
            return true;
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }
}