#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int n, m;
    cin >> n >> m;
    vector<int> a(m), b(m);
    vector<vector<int>> g(n);
    rep(i,m){
        cin >> a[i] >> b[i];
        --a[i];--b[i];
        g[a[i]].push_back(b[i]);
        g[b[i]].push_back(a[i]);
    }
    vector<int> c(n), w(10); 
    rep(i,n){
        cin >> c[i];
        --c[i];
    }
    rep(i,10) cin >> w[i];
    vector<dsu> uf_s(1<<10);
    vector<ll> cost(1<<10);
    rep(i,1<<10){
        dsu uf(n);
        rep(j,10) if(i>>j&1) cost[i] += w[j];
        rep(j,n){
            if(~i>>c[j]&1) continue;
            for(int v : g[j]) {
                if(i>>c[v]&1){
                    uf.merge(j,v);
                }
            }
        }
        uf_s[i] = uf;
        dbg(uf.groups());
    }
    int q;
    cin >> q;
    while(q--){
        int u, v;
        cin >> u >> v;
        --u;--v;
        ll ans = 1e18;
        rep(i,1<<10){
            if(uf_s[i].same(u,v)) ans = min(ans, cost[i]);
        }
        if(ans==1e18) ans = -1;
        cout << ans << "\n";
    }
    return 0;
}