On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy.

The toy consists of n parts and m ropes. Each rope links two parts, but every pair of parts is linked by at most one rope. To split the toy, the child must remove all its parts. The child can remove a single part at a time, and each remove consume an energy. Let's define an energy value of part i as vi. The child spend vf1 + vf2 + ... + vfk energy for removing part i where f1, f2, ..., fk are the parts that are directly connected to the i-th and haven't been removed.

Help the child to find out, what is the minimum total energy he should spend to remove all n parts.

Input

The first line contains two integers n and m (1 ≤ n ≤ 1000; 0 ≤ m ≤ 2000). The second line contains n integers: v1, v2, ..., vn (0 ≤ vi ≤ 105). Then followed m lines, each line contains two integers xi and yi, representing a rope from part xi to part yi (1 ≤ xi, yi ≤ n; xi ≠ yi).

Consider all the parts are numbered from 1 to n.

Output

Output the minimum total energy the child should spend to remove all n parts of the toy.

Examples

Input

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


Output

40


Input

4 4
100 100 100 100
1 2
2 3
2 4
3 4


Output

400


Input

7 10
40 10 20 10 20 80 40
1 5
4 7
4 5
5 2
5 7
6 4
1 6
1 3
4 3
1 4


Output

160

Note

One of the optimal sequence of actions in the first sample is:

  * First, remove part 3, cost of the action is 20. 
  * Then, remove part 2, cost of the action is 10. 
  * Next, remove part 4, cost of the action is 10. 
  * At last, remove part 1, cost of the action is 0. 



So the total energy the child paid is 20 + 10 + 10 + 0 = 40, which is the minimum.

In the second sample, the child will spend 400 no matter in what order he will remove the parts.

import java.io.*;
import java.util.*;
import java.math.*;

public class Main { 

    static class Node {
        int id;
        int val;
        int cost;
        Node(int id, int val, int cost) {
            this.id = id;
            this.val = val;
            this.cost = cost;
        }
        // public int compareTo(Node b) {
            
        // }
        public String toString() {
            return this.id+" "+this.val+" "+this.cost;
        }
    }

    static HashSet<Integer>[] grp;
    static boolean[] vis;
    
    public static void main(String[] args) throws java.lang.Exception { 
        Reader pm =new Reader(); 
        //Scanner pm = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        int t = 1;
        while(t-- > 0){
            int n = pm.nextInt();
            int m = pm.nextInt();

            int[] a = new int[n];

            for(int i=0;i<n;i++) 
                a[i] = pm.nextInt();

            grp = new HashSet[n];
            vis = new boolean[n];
            for(int i=0;i<n;i++) {
                grp[i] = new HashSet<>();
            }
            long ans = 0;
            for(int i=0;i<m;i++){
                int u = pm.nextInt() - 1;
                int v = pm.nextInt() - 1;

                grp[v].add(u);
                grp[u].add(v);

                ans += Math.min(a[u], a[v]);
            }
            //PriorityQueue<Node> pq = new PriorityQueue<>();
            TreeSet<Node> ts = new TreeSet<>(new Comparator<Node>() {
                public int compare(Node a, Node b) {
                    if(a.id == b.id) 
                        return 0;
                    else  {
                        if(a.cost < b.cost) 
                            return -1;
                        if(a.cost == b.cost && a.val > b.val) 
                            return -1;
                        return 1;
                    }
                }
            });
            // HashMap<Integer, Integer> hm = new HashMap<>();

            // for(int i=0;i<n;i++) {
            //     int cost = 0;
            //     for(int j : grp[i]) 
            //         cost += a[j];
            //     ts.add(new Node(i, a[i], cost));
            //     hm.put(i, cost);
            // }
            // System.out.println(hm.get(3));

            // long ans = 0;


            // while(ts.size() != 0) {

            //     Node top = ts.pollFirst();

            //     System.out.println(top.id);
            //     //System.out.println(ts.contains(ts.first())+" "+ts.first());

            //     //ts.remove(ts.first());
            //     //ts.add(new Node(top.id, a[top.id], Integer.MAX_VALUE));

            //     //System.out.println("mid "+ts+" "+ts.contains(top)+" "+top);
            //     if(top.cost > 0) 
            //         ans += top.cost;

            //     System.out.println(top.cost+" "+ans);

            //     int id = top.id;
            //     vis[id] = true; 

            //     for(int j=0;j<n;j++) {
            //         grp[j].remove(id);
            //         //grp[id].remove(j);
            //     }    

            //     for(int j=0;j<n;j++) {
            //         if(grp[id].contains(j)) {
            //             //if(!vis[j]) {
            //                 int cur = hm.get(j);
            //                 ts.remove(new Node(j, a[j], cur));
            //                 cur -= top.val;
            //                 //if(!vis[j])
            //                 if(j != id && cur > 0)
            //                     ts.add(new Node(j, a[j], cur));
            //                 hm.put(j, cur);
            //             }
                    
            //        // }
            //     }        

            //     // for(int j : grp[id]) {
            //     //     if(!vis[j]) {
            //     //         int cur = hm.get(j);
            //     //         ts.remove(new Node(j, a[j], cur));
            //     //         cur -= top.val;
            //     //         //if(!vis[j])
            //     //             ts.add(new Node(j, a[j], cur));
            //     //         hm.put(j, cur);
            //     //     }
            //     // }

            //     System.out.println("end "+ts+"\n");
            // }

            System.out.println(ans);
        }
        //end of tests
        
    }
    //end of main class

    static int countInRange(int arr[], int n, int x, int y) { 
        // initialize result 
        int count = 0; 
        count = upperIndex(arr, n, y) -  
                lowerIndex(arr, n, x) + 1; 
        return count; 
    } 
    
    
    static int lowerIndex(int arr[], int n, int x) { 
        int l = 0, h = n - 1; 
        while (l <= h)  
        { 
            int mid = (l + h) / 2; 
            if (arr[mid] >= x) 
                h = mid - 1; 
            else
                l = mid + 1; 
        } 
        return l; 
    } 
      
    // function to find last index <= y 
    static int upperIndex(int arr[], int n, int y) { 
        int l = 0, h = n - 1; 
        while (l <= h)  
        { 
            int mid = (l + h) / 2; 
            if (arr[mid] <= y) 
                l = mid + 1; 
            else
                h = mid - 1; 
        } 
        return h; 
    }
    
    public static StringBuilder dec_to_bin(long n) {
        // decimal to binary upto 30 binaries
        if(n==0) {
            StringBuilder str=new StringBuilder("");
            for(int i=0;i<30;i++) {
                str.append("0");
            }
            return str;
        }
        StringBuilder str=new StringBuilder("");
        while(n!=0) {
            str.append(n%2L);
            n/=2L;
        }
        str=str.reverse();
        StringBuilder tmp_str=new StringBuilder("");
        int len=str.length();
        while(len!=30) {
            tmp_str.append("0");
            len++;
        }
        tmp_str.append(str);
        return tmp_str;
    }
    
    private static int binarySearchPM(int[] arr, int key){
        int n = arr.length;
        int mid = -1;
        int begin = 0,end=n;
        while(begin <= end){
            mid = (begin+end) / 2;
            if(mid == n){
                return n;
            }
            if(key < arr[mid]){
                end = mid-1;
            } else if(key > arr[mid]){
                begin = mid+1;
            } else {
                return mid;
            }
        }
        //System.out.println(begin+" "+end);
        return -begin; //expected Index
    }
    
    static class Reader { 
        final private int BUFFER_SIZE = 1 << 16; 
        private DataInputStream din; 
        private byte[] buffer; 
        private int bufferPointer, bytesRead; 
  
        public Reader() 
        { 
            din = new DataInputStream(System.in); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public Reader(String file_name) throws IOException 
        { 
            din = new DataInputStream(new FileInputStream(file_name)); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public String readLine() throws IOException 
        { 
            byte[] buf = new byte[64]; // line length 
            int cnt = 0, c; 
            while ((c = read()) != -1) 
            { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } 
            return new String(buf, 0, cnt); 
        } 
  
        public int nextInt() throws IOException 
        { 
            int ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do
            { 
                ret = ret * 10 + c - '0'; 
            }  while ((c = read()) >= '0' && c <= '9'); 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public long nextLong() throws IOException 
        { 
            long ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public double nextDouble() throws IOException 
        { 
            double ret = 0, div = 1; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
  
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
  
            if (c == '.') 
            { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        private void fillBuffer() throws IOException 
        { 
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
            if (bytesRead == -1) 
                buffer[0] = -1; 
        } 
  
        private byte read() throws IOException 
        { 
            if (bufferPointer == bytesRead) 
                fillBuffer(); 
            return buffer[bufferPointer++]; 
        } 
  
        public void close() throws IOException 
        { 
            if (din == null) 
                return; 
            din.close(); 
        } 
    }
}    