#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

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

int N, M, Q;
int C[10101];
ll W[10];
int A[10101], B[10101];
atcoder::dsu ufs[1024];
ll cost[1024];
int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cin >> N >> M;
    for(int i = 0;i < M;i++){
        cin >> A[i] >> B[i];
        A[i]--, B[i]--;
    }
    for(int i = 0;i < N;i++){
        cin >> C[i];
        C[i]--;
    }
    for(int i = 0;i < 10;i++)cin >> W[i];
    for(int i = 0;i < 1 << 10;i++){
        ll c = 0;
        for(int j = 0;j < 10;j++){
            if(i >> j & 1)c += W[j];
        }
        atcoder::dsu uf(N);
        for(int j = 0;j < M;j++){
            if(i >> C[A[j]] & i >> C[B[j]] & 1){
                uf.merge(A[j], B[j]);
            }
        }
        ufs[i] = uf;
        cost[i] = c;
    }
    cin >> Q;
    while(Q--){
        int u, v; cin >> u >> v;
        u--, v--;
        ll ans = inf;
        for(int i = 0;i < 1 << 10;i++){
            if(ufs[i].same(u, v)){
                ans = min(ans, cost[i]);
            }
        }
        cout << (ans == inf ? -1 : ans) << endl;
    }
    return 0;
}