#include <bits/stdc++.h>
using namespace std;
int answer = 1e9;
int c[40];
vector<int> g[40];
int n, m;
void dfs(int x, long long bit, int cost) {
  int nextBit = bit;
  int diff = 0;
  if (!(bit >> x & 1)) {
    diff += c[x];
    nextBit |= (1ll << x);
  }
  for (auto i : g[x]) {
    if (!(bit >> i & 1)) {
      nextBit |= (1ll << i);
      diff += c[i];
    }
  }
  int nextCost = cost + diff;
  if (nextCost >= answer) {
    return;
  }
  if (x == n - 1) {
    answer = nextCost;
    return;
  }
  for (auto i : g[x]) {
    if ((bit >> i & 1) == 0) dfs(i, nextBit, nextCost);
  }
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> c[i];
  }
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    --a, --b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  dfs(0, 0, 0);
  cout << answer << endl;
}
