#include <bits/stdc++.h>
using namespace std;
#define int long long
int N;
int M;
int C[10000];
int W[10000];
long long cost[1024];
vector<int> G[10000];
int Group[10000][1024];
int Answers[10000];
signed main(void){
    cin >> N >> M;
    for(int i = 0; i < 1024; i++){
        for(int j = 0; j < N; j++){
            Group[i][j] = -1;
        }
    }
    int a;
    int b;
    int c;
    for(int i = 0; i < M; i++){
        cin >> a >> b;
        G[a-1].push_back(b-1);
        G[b-1].push_back(a-1);
    }
    for(int i = 0; i < N; i++){
        cin >> c;
        C[i] = c;
    }
    for(int i = 0; i < 10; i++){
        cin >> c;
        W[i] = c;
    }
    for(int i = 0; i < 1024; i++){
        int T = 0;
        int w = 0;
        unordered_set<int> S={};
        int c = 0;
        for(int j = 0; j < 10; j++){
            if(i & (1<<j)){
                S.insert(j + 1);
                c+=W[j];
            }
        }
        cost[i] = c;
        while(T < N){
            queue<int> que={};
            que.push(T);
            Group[i][T] = w;
            while (!que.empty()){
                int p = que.front();
                que.pop();
                for(int q:G[p]){
                    if(S.count(C[p]) && S.count(C[q]) && Group[i][q] == -1){
                        Group[i][q] = Group[i][p];
                        que.push(q);
                    }
                }
            }
            while (Group[i][T] != -1){
                T+=1;
                if(T >= N){
                    break;
                }
            }
            w+=1;
        }
    }
    int Q;
    cin >> Q;
    int u;
    int v;
    for(int i = 0; i < Q; i++){
        long long ans = -1;
        cin >> u >> v;
        u-=1;
        v-=1;
        for(int j = 0; j < 1024; j++){
            if(Group[j][u]==Group[j][v]){
                if(ans == -1 || cost[j] < ans){
                    ans = cost[j];
                }
            }
        }
        Answers[i] = ans;
    }
    for(int i = 0; i < Q; i++){
        cout << Answers[i] << endl;
    }
}