#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	int n, m; cin >> n >> m;
	vector<int> a(m), b(m);
	rep(i,0,m){
		cin >> a[i] >> b[i];
		a[i]--;
		b[i]--;
	}

	vector<int> c(n);
	rep(i,0,n){
		cin >> c[i];
		c[i]--;
	}

	vector<ll> w(10);
	rep(i,0,10){
		cin >> w[i];
	}

	int q; cin >> q;
	vector<int> u(q), v(q);
	rep(i,0,q){
		cin >> u[i] >> v[i];
		u[i]--;
		v[i]--;
	}

	vector<ll> ans(q, 1e18);
	rep(i,0,1<<10){
		ll cost = 0;
		dsu uf(n);
		rep(j,0,10){
			if (i >> j & 1){
				cost += w[j];
			}
		}
		rep(j,0,m){
			if ((i>>c[a[j]]&1) && (i>>c[b[j]]&1)){
				uf.merge(a[j], b[j]);
			}
		}
		rep(j,0,q){
			if (uf.same(u[j], v[j])){
				chmin(ans[j], cost);
			}
		}
	}

	rep(i,0,q){
		if (ans[i] > 1e17){
			cout << "-1\n";
		} else{
			cout << ans[i] << '\n';
		}
	}
}