# 頂点グループ化はできない、グループ化してもその間の移動は別だから
# C小さいのでビット全探索かTSP、毎回TSPしては間に合わない、ということはビット全探索
# ビット全探索とUnion Findでどうか、クエリ先読み

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 unite(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 = map(int, input().split())
edge_list = []
for i in range(M):
    a, b = map(int, input().split())
    edge_list.append((a-1, b-1))
    
C = list(map(int, input().split()))
W = list(map(int, input().split()))

C = [c-1 for c in C]

from collections import defaultdict
Q = int(input())
INF = 10**20
query = defaultdict(int)
query_list = []
for q in range(Q):
    u, v = map(int, input().split())
    u -= 1
    v -= 1
    query_list.append((u, v))
    query[(u, v)] = INF

#from collections import defaultdict
C_len = 10

for bit in range(1<<C_len):
    
    UF_temp = UnionFind(N)
    C_use = set()
    cost_temp = 0
    for shift in range(C_len):
        if bit>>shift&1 == 1:
            C_use.add(shift)
            cost_temp += W[shift]
    
    for a, b in edge_list:
        if C[a] in C_use and C[b] in C_use:
            UF_temp.unite(a, b)
    
    #print('cost_temp', cost_temp, UF_temp.all_group_members())

    for u, v in query_list:
        if UF_temp.same(u, v) == True:
            query[(u, v)] = min(query[(u, v)], cost_temp)
    
for u, v in query_list:
    ans = query[(u, v)]
    if ans == INF:
        print(-1)
    else:
        print(ans)