#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = 2 * acos((long double)0);
long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
void setmin(T& a, T val) {
  if (a > val) a = val;
}
template <class T>
void setmax(T& a, T val) {
  if (a < val) a = val;
}
void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
const int maxn = 1010;
int n, m;
int a[maxn];
vector<int> adj[maxn];
int f[maxn];
void solve() {
  cin >> n >> m;
  for (int i = (0); i < (n); i++) cin >> a[i];
  for (int i = (0); i < (m); i++) {
    int u, v;
    cin >> u >> v;
    u--;
    v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  priority_queue<pair<int, int> > pq;
  for (int i = (0); i < (n); i++) {
    pq.push(make_pair(a[i], i));
  }
  long long ans = 0;
  while (int((pq).size())) {
    int u = pq.top().second;
    pq.pop();
    if (f[u]) continue;
    f[u] = 1;
    for (int i = (0); i < (int((adj[u]).size())); i++) {
      int v = adj[u][i];
      if (!f[v]) {
        ans += a[v];
      }
    }
  }
  cout << ans;
}
int main() {
  solve();
  return 0;
}
