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

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

int main() {
    ll N, M;
    cin >> N >> M;
    vector<ll> A(M);
    vector<ll> B(M);
    for (ll i = 0; i < M; i++) {
        cin >> A[i] >> B[i];
        A[i]--;
        B[i]--;
    }
    vector<vector<ll>> graph(N, vector<ll>(0));
    for (ll i = 0; i < M; i++) {
        graph[A[i]].push_back(B[i]);
        graph[B[i]].push_back(A[i]);
    }
    vector<ll> C(N);
    for (ll i = 0; i < N; i++) {
        cin >> C[i];
        C[i]--;
    }
    vector<ll> W(10);
    for (ll i = 0; i < 10; i++) {
        cin >> W[i];
    }
    ll Q;
    cin >> Q;
    vector<ll> u(Q);
    vector<ll> v(Q);
    for (ll i = 0; i < Q; i++) {
        cin >> u[i] >> v[i];
        u[i]--;
        v[i]--;
    }
    ll INF = 10000000000000243;
    vector<ll> ans(Q, INF);
    for (ll c = 0; c < (1 << 10); c++) {
        ll costs = 0;
        for (ll i = 0; i < 10; i++) {
            if ((c >> i) & 1) {
                costs += W[i];
            }
        }
        dsu tree(N);
        for (ll i = 0; i < M; i++) {
            if (((c >> C[A[i]]) & 1) && ((c >> C[B[i]]) & 1)) {
                tree.merge(A[i], B[i]);
            }
        }
        for (ll i = 0; i < Q; i++) {
            if (tree.same(u[i], v[i])) {
                ans[i] = min(ans[i], costs);
            }
        }
    }
    for (ll i = 0; i < Q; i++) {
        if (ans[i] == INF) {
            cout << -1 << endl;
        } else {
            cout << ans[i] << endl;
        }
    }
}