#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#include <atcoder/dsu>
using namespace atcoder;

int main() {
  int N, M;
  cin >> N >> M;
  vector<vector<int>> G(N);
  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);
  }
  vector<int> C(N);
  for (int i = 0; i < N; i++) {
    cin >> C[i];
    C[i]--;
  }
  vector<ll> W(10);
  for (int i = 0; i < 10; i++) {
    cin >> W[i];
  }
  int Q;
  cin >> Q;
  vector<int> u(Q), v(Q);
  for (int i = 0; i < Q; i++) {
    cin >> u[i] >> v[i];
    u[i]--, v[i]--;
  }
  const ll inf = 1e18;
  vector<ll> ans(Q, inf);
  for (int s = 0; s < (1 << 10); s++) {
    dsu Union(N);
    for (int i = 0; i < N; i++) {
      if (s & (1 << C[i])) {
        for (int j = 0; j < (int)G[i].size(); j++) {
          if (s & (1 << C[G[i][j]])) {
            Union.merge(i, G[i][j]);
          }
        }
      }
    }
    ll cost = 0;
    for (int i = 0; i < 10; i++) {
      if (s & (1 << i)) {
        cost += W[i];
      }
    }
    for (int i = 0; i < Q; i++) {
      if (Union.same(u[i], v[i])) {
        ans[i] = min(ans[i], cost);
      }
    }
  }
  for (int i = 0; i < Q; i++) {
    if (ans[i] == inf) {
      ans[i] = -1;
    }
    cout << ans[i] << endl;
  }
  return 0;
}