#include <bits/stdc++.h>
#ifdef LOCAL
#include "./debug.cpp"
#else
#define debug(...)
#define print_line
#endif
using namespace std;
using ll = long long;

#include <atcoder/dsu>

int main() {
    int N, M;
    cin >> N >> M;
    vector<pair<int, int>> E(M);
    for (int i = 0; i < M; i++) {
        cin >> E[i].first >> E[i].second;
        E[i].first--;
        E[i].second--;
    }
    vector<int> C(N);
    for (int i = 0; i < N; i++) cin >> C[i], C[i]--;
    vector<int> W(10);
    for (int i = 0; i < 10; i++) cin >> W[i];

    vector<atcoder::dsu> ds(1 << 10);
    vector<ll> cost(1 << 10);
    for (int i = 0; i < 1 << 10; i++) {
        ds[i] = atcoder::dsu(N);

        for (int j = 0; j < 10; j++) {
            if (i >> j & 1) cost[i] += W[j];
        }

        for (int j = 0; j < M; j++) {
            auto [u, v] = E[j];
            if ((i >> C[u] & 1) && (i >> C[v] & 1)) {
                ds[i].merge(u, v);
            }
        }
    }

    int Q;
    cin >> Q;
    while (Q--) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;

        ll ans = LLONG_MAX;
        for (int i = 0; i < 1 << 10; i++) {
            if (ds[i].same(u, v)) ans = min(ans, cost[i]);
        }

        if (ans == LLONG_MAX) ans = -1;
        cout << ans << '\n';
    }
}