Of course our child likes walking in a zoo. The zoo has n areas, that are numbered from 1 to n. The i-th area contains ai animals in it. Also there are m roads in the zoo, and each road connects two distinct areas. Naturally the zoo is connected, so you can reach any area of the zoo from any other area using the roads.

Our child is very smart. Imagine the child want to go from area p to area q. Firstly he considers all the simple routes from p to q. For each route the child writes down the number, that is equal to the minimum number of animals among the route areas. Let's denote the largest of the written numbers as f(p, q). Finally, the child chooses one of the routes for which he writes down the value f(p, q).

After the child has visited the zoo, he thinks about the question: what is the average value of f(p, q) for all pairs p, q (p ≠ q)? Can you answer his question?

Input

The first line contains two integers n and m (2 ≤ n ≤ 105; 0 ≤ m ≤ 105). The second line contains n integers: a1, a2, ..., an (0 ≤ ai ≤ 105). Then follow m lines, each line contains two integers xi and yi (1 ≤ xi, yi ≤ n; xi ≠ yi), denoting the road between areas xi and yi.

All roads are bidirectional, each pair of areas is connected by at most one road.

Output

Output a real number — the value of <image>.

The answer will be considered correct if its relative or absolute error doesn't exceed 10 - 4.

Examples

Input

4 3
10 20 30 40
1 3
2 3
4 3


Output

16.666667


Input

3 3
10 20 30
1 2
2 3
3 1


Output

13.333333


Input

7 8
40 20 10 30 20 50 40
1 2
2 3
3 4
4 5
5 6
6 7
1 4
5 7


Output

18.571429

Note

Consider the first sample. There are 12 possible situations:

  * p = 1, q = 3, f(p, q) = 10. 
  * p = 2, q = 3, f(p, q) = 20. 
  * p = 4, q = 3, f(p, q) = 30. 
  * p = 1, q = 2, f(p, q) = 10. 
  * p = 2, q = 4, f(p, q) = 20. 
  * p = 4, q = 1, f(p, q) = 10. 



Another 6 cases are symmetrical to the above. The average is <image>.

Consider the second sample. There are 6 possible situations:

  * p = 1, q = 2, f(p, q) = 10. 
  * p = 2, q = 3, f(p, q) = 20. 
  * p = 1, q = 3, f(p, q) = 10. 



Another 3 cases are symmetrical to the above. The average is <image>.
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.util.List;

public class Main {
    private static StringTokenizer st;
    private static BufferedReader br;
    public static long MOD = 1000000009;

    public static void print(Object x) {
        System.out.println(x + "");
    }
    public static void printArr(long[] x) {
        StringBuilder s = new StringBuilder();
        for (int i = 0; i < x.length; i++) {
            s.append(x[i] + " ");
        }
        print(s);
    }
    public static void printArr(int[] x) {
        StringBuilder s = new StringBuilder();
        for (int i = 0; i < x.length; i++) {
            s.append(x[i] + " ");
        }
        print(s);
    }
    public static String join(Collection<?> x, String space) {
        if (x.size() == 0) return "";
        StringBuilder sb = new StringBuilder();
        boolean first = true;
        for (Object elt : x) {
            if (first) first = false;
            else sb.append(space);
            sb.append(elt);
        }
        return sb.toString();
    }

    public static String nextToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            String line = br.readLine();
            st = new StringTokenizer(line.trim());
        }
        return st.nextToken();
    }
    public static int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }
    public static long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }
    public static List<Integer> nextInts(int N) throws IOException {
        List<Integer> ret = new ArrayList<Integer>();
        for (int i = 0; i < N; i++) {
            ret.add(nextInt());
        }
        return ret;
    }

    private static int[] parents;
    private static long[] size;

    public static void initDSU(int n) {
        parents = new int[n];
        size = new long[n];
        for (int i = 0; i < n; i++) {
            parents[i] = i;
            size[i] = 1;
        }
    }
    public static int rep(int x) {
        if (parents[x] == x) return x;
        else return rep(parents[x]);
    }
    public static long size(int x) {
        return size[rep(x)];
    }
    public static void join(int x, int y) {
        x = rep(x);
        y = rep(y);
        if (size[x] < size[y]) {
            parents[x] = y;
            size[y] += size[x];
        } else {
            parents[y] = x;
            size[x] += size[y];
        }
    }

    public static class Area {
        long animals;
        int number;
        List<Integer> neighbors = new ArrayList<Integer>();
        public Area(long s, int n) {
            animals = s;
            number = n;
        }
    }

    public static class Edge {
        long animals;
        int x;
        int y;
        public Edge(long s, int x, int y) {
            animals = s;
            this.x = x;
            this.y = y;
        }
    }

    public static void main(String[] args) throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        int n = nextInt();
        int m = nextInt();
        long[] animals = new long[n];
        for (int i = 0; i < n; i++) {
            animals[i] = nextLong();
        }

        List<Edge> edges = new ArrayList<Edge>();
        for (int i = 0; i < m; i++) {
            int x = nextInt() - 1;
            int y = nextInt() - 1;
            edges.add(new Edge(Math.min(animals[x], animals[y]), x, y));
        }

        Collections.sort(edges, new Comparator<Edge>() {
            @Override
            public int compare(Edge o1, Edge o2) {
                return ((Long) o2.animals).compareTo(o1.animals);
            }
        });

        double total = 0;
        initDSU(n);
        for (Edge e : edges) {
            if (rep(e.x) == rep(e.y)) continue;
            total += 2 * size(e.x) * size(e.y) * e.animals;
            join(e.x, e.y);
        }
        System.out.printf("%.8f", (total / n) / (n - 1));
    }
}
