#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001



int main(){
	
	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<long long> w(10);
	rep(i,10)cin>>w[i];
	int q;
	cin>>q;
	vector<long long> ans(q,Inf64);
	
	vector<int> u(q),v(q);
	rep(i,q){
		cin>>u[i]>>v[i];
		u[i]--,v[i]--;
	}
	
	rep(i,1<<10){
		dsu D(n);
		rep(j,m){
			if((i>>c[a[j]])&1){
				if((i>>c[b[j]])&1)D.merge(a[j],b[j]);
			}
		}
		long long cost  = 0;
		rep(j,10){
			if((i>>j)&1)cost += w[j];
		}
		rep(j,q){
			if(D.same(u[j],v[j])&&((i>>c[u[j]])&1)&&((i>>c[v[j]])&1))ans[j] = min(ans[j],cost);
			
		}
	}
	rep(i,q){
		long long aa = ans[i];
		if(aa==Inf64)aa = -1;
		cout<<aa<<endl;
	}
	
	return 0;
}