#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct Data {
	dsu uf;
	long long cost;
	Data() {}
	Data(dsu uf, long long cost) :uf(uf), cost(cost) {}
};
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<int>a(m), b(m);
	rep(i, m) {
		cin >> a[i] >> b[i];
		a[i]--, b[i]--;
	}
	vector<int>c(n);
	rep(i, n)cin >> c[i], c[i]--;
	vector<int>w(10);
	rep(i, 10)cin >> w[i];
	vector<Data>memo(1 << 10);
	rep(i, 1 << 10) {
		long long cost = 0;
		rep(j, 10) {
			if (1 & (i >> j))cost += w[j];
		}
		dsu uf(n);
		rep(j, m) {
			if (!(1 & (i >> c[a[j]])))continue;
			if (!(1 & (i >> c[b[j]])))continue;
			uf.merge(a[j], b[j]);
		}
		memo[i] = Data(uf, cost);
	}
	int q; cin >> q;
	while (q--) {
		int u, v; cin >> u >> v;
		u--, v--;
		long long ans = LINF;
		rep(i, 1 << 10) {
			if (memo[i].uf.same(u, v)) {
				chmin(ans, memo[i].cost);
			}
		}
		if (LINF == ans)ans = -1;
		cout << ans << endl;
	}
	return 0;
}