#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


template<typename T>
struct edge{
    int from, to;
    T cost;
    int id;

    edge(){}
    edge(int to, T cost=1) : from(-1), to(to), cost(cost){}
    edge(int to, T cost, int id) : from(-1), to(to), cost(cost), id(id){}
    edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id){}
};

template<typename T>
struct redge{
    int from, to;
    T cap, cost;
    int rev;
    
    redge(int to, T cap, T cost=(T)(1)) : from(-1), to(to), cap(cap), cost(cost){}
    redge(int to, T cap, T cost, int rev) : from(-1), to(to), cap(cap), cost(cost), rev(rev){}
};

template<typename T> using Edges = vector<edge<T>>;
template<typename T> using weighted_graph = vector<Edges<T>>;
template<typename T> using tree = vector<Edges<T>>;
using unweighted_graph = vector<vector<int>>;
template<typename T> using residual_graph = vector<vector<redge<T>>>;


struct union_find{
    vector<int> par;
    vector<int> siz;
    
    union_find(int n) : par(n), siz(n, 1){
        for(int i=0; i<n; i++) par[i] = i;
    }
    
    int root(int x){
        if (par[x] == x) return x;
        return par[x] = root(par[x]);
    }
 
    void unite(int x, int y){
        int rx = root(x);
        int ry = root(y);
        if (rx == ry) return;
        if (siz[rx] < siz[ry]) swap(rx, ry);
        siz[rx] += siz[ry];
        par[ry] = rx;
    }
 
    bool same(int x, int y){
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }
 
    int size(int x){
        return siz[root(x)];
    }
};


void solve(){
	int n, m; cin >> n >> m;
	unweighted_graph G(n);
	for(int i=0; i<m; i++){
		int u, v; cin >> u >> v;
		u--; v--;
		G[u].pb(v);
		G[v].pb(u);
	}

	vector<int> c(n);
	for(int i=0; i<n; i++){
		cin >> c[i];
		c[i]--;
	}

	vector<ll> w(10);
	for(int i=0; i<10; i++) cin >> w[i];

	vector<union_find> uf(1<<10, union_find(n));
	vector<ll> cost(1<<10, 0);
	for(int bit=0; bit<(1<<10); bit++){
		for(int i=0; i<10; i++) if((bit>>i)&1) cost[bit]+=w[i];

		for(int v=0; v<n; v++) if((bit>>c[v])&1){
			for(int to : G[v]) if((bit>>c[to])&1){
				uf[bit].unite(v, to);
			}	
		}
	}

	int q; cin >> q;
	while(q--){
		int u, v; cin >> u >> v;
		u--; v--;
		ll ans = LINF;
		for(int bit=0; bit<(1<<10); bit++) if(uf[bit].same(u, v)){
			ans = min(ans, cost[bit]);
		}
		if(ans==LINF) cout << -1 << '\n';
		else cout << ans << '\n';
	}
}

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	
	int T=1;
	//cin >> T;
	while(T--) solve();
}