import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes")
no = lambda :print("no");No = lambda :print("No")
#######################################################################

from collections import defaultdict
 
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
 
    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
 
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
 
        if x == y:
            return
 
        if self.parents[x] > self.parents[y]:
            x, y = y, x
 
        self.parents[x] += self.parents[y]
        self.parents[y] = x
 
    def size(self, x):
        return -self.parents[self.find(x)]
 
    def same(self, x, y):
        return self.find(x) == self.find(y)
 
    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
 
    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]
 
    def group_count(self):
        return len(self.roots())
 
    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members
 
    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

N, M = na()
D = 10
E = []
for _ in range(M):
    x, y = na()
    E.append((x-1, y-1))
c = [x-1 for x in na()]
s = na()
score = [0] * (1<<D)
for bit in range(1<<D):
    for i in range(D):
        if (bit>>i)&1:
            score[bit] += s[i]
ufs = [UnionFind(N) for _ in range(1<<D)]
for bit in range(1<<D):
    for i, j in E:
        if (bit>>c[i])&1 and (bit>>c[j])&1:
            ufs[bit].union(i, j)
Q = ni()
inf = 10**18
for _ in range(Q):
    x, y = na()
    x -= 1
    y -= 1
    ans = inf
    for bit in range(1<<D):
        if ufs[bit].same(x, y):
            #print(bin(bit))
            ans = min(ans, score[bit])
    print(ans if ans != inf else -1)