#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

struct UnionFind {
  explicit UnionFind(const int n) : data(n, -1) {}

  int root(const int ver) {
    return data[ver] < 0 ? ver : data[ver] = root(data[ver]);
  }

  bool unite(int u, int v) {
    u = root(u);
    v = root(v);
    if (u == v) return false;
    if (data[u] > data[v]) std::swap(u, v);
    data[u] += data[v];
    data[v] = u;
    return true;
  }

  bool is_same(const int u, const int v) { return root(u) == root(v); }

  int size(const int ver) { return -data[root(ver)]; }

 private:
  std::vector<int> data;
};

int main() {
  constexpr int C = 10;
  int n, m; cin >> n >> m;
  vector<int> a(m), b(m); REP(i, m) cin >> a[i] >> b[i], --a[i], --b[i];
  vector<int> c(n);
  for (int& c_i : c) cin >> c_i, --c_i;
  array<int, C> w{};
  for (int& w_i : w) cin >> w_i;
  vector uf(1 << C, UnionFind(n));
  FOR(bit, 1, 1 << C) REP(i, m) {
    if ((bit >> c[a[i]] & 1) && (bit >> c[b[i]] & 1)) uf[bit].unite(a[i], b[i]);
  }
  array<ll, 1 << C> cost{};
  FOR(bit, 1, 1 << C) REP(i, C) {
    if (bit >> i & 1) cost[bit] += w[i];
  }
  int q; cin >> q;
  while (q--) {
    int u, v; cin >> u >> v; --u; --v;
    ll ans = LINF;
    FOR(bit, 1, 1 << C) {
      if (uf[bit].is_same(u, v)) chmin(ans, cost[bit]);
    }
    cout << (ans == LINF ? -1 : ans) << '\n';
  }
  return 0;
}