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())
    

import sys
input=sys.stdin.readline
N,M=map(int,input().split())
exp2=[2**i for i in range(20)]
edges=[]
for _ in range(M):
    a,b=map(int,input().split())
    a-=1
    b-=1
    edges.append((a,b))
C=list(map(int,input().split()))
W=list(map(int,input().split()))
point=[0]*(2**10)
for i in range(2**10):
    for j in range(10):
        if i&exp2[j]:
            point[i]+=W[j]
Q=int(input())
fa=[10**10]*Q
querys=[]
for _ in range(Q):
    u,v=map(int,input().split())
    u-=1
    v-=1
    querys.append((u,v))
for i in range(2**10):
    uf=UnionFind(N)
    for a,b in edges:
        if exp2[C[a]-1]&i and exp2[C[b]-1]&i:
            uf.union(a,b)
    for j in range(Q):
        u,v=querys[j]
        if uf.same(u,v):
            fa[j]=min(point[i],fa[j])
for i in range(Q):
    if fa[i]==10**10:
        fa[i]=-1
print(*fa,sep='\n')