#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T, class U>
inline void print(T first, U second) {
  printsp(first);
  println(second);
}
template <class T, class U, class V>
inline void print(T first, U second, V z) {
  printsp(first);
  printsp(second);
  println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int val[1111];
set<pair<int, pair<int, int> > > s;
vector<int> adj[1111];
int cur[1111];
int vst[1111];
int main() {
  int n, m, u, v;
  gn(n, m);
  for (int i = 1; i <= n; i++) gn(val[i]);
  while (m--) {
    gn(u, v);
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < adj[i].size(); j++) cur[i] += val[adj[i][j]];
    s.insert(pair<int, pair<int, int> >(0x3f3f3f3f - val[i],
                                        pair<int, int>(cur[i], i)));
  }
  int ans = 0;
  while (1) {
    if (s.empty()) break;
    u = (s.begin()->second).second;
    ans += s.begin()->second.first;
    s.erase(s.begin());
    vst[u] = 1;
    for (int j = 0; j < adj[u].size(); j++) {
      v = adj[u][j];
      if (vst[v]) continue;
      s.erase(pair<int, pair<int, int> >(0x3f3f3f3f - val[v],
                                         pair<int, int>(cur[v], v)));
      cur[v] -= val[u];
      s.insert(pair<int, pair<int, int> >(0x3f3f3f3f - val[v],
                                          pair<int, int>(cur[v], v)));
    }
  }
  println(ans);
}
