class dsu():
  n=1
  parent_or_size=[-1 for i in range(n)]
  def __init__(self,N):
    self.n=N
    self.parent_or_size=[-1 for i in range(N)]
  def merge(self,a,b):
    assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n)
    assert 0<=b<self.n, "0<=b<n,b={0},n={1}".format(b,self.n)
    x=self.leader(a)
    y=self.leader(b)
    if x==y:
        return x
    if (-self.parent_or_size[x]<-self.parent_or_size[y]):
        x,y=y,x
    self.parent_or_size[x]+=self.parent_or_size[y]
    self.parent_or_size[y]=x
    return x
  def same(self,a,b):
    assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n)
    assert 0<=b<self.n, "0<=b<n,b={0},n={1}".format(b,self.n)
    return self.leader(a)==self.leader(b)
  def leader(self,a):
    assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n)
    if (self.parent_or_size[a]<0):
      return a
    self.parent_or_size[a]=self.leader(self.parent_or_size[a])
    return self.parent_or_size[a]
  def size(self,a):
    assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n)
    return -self.parent_or_size[self.leader(a)]
  def groups(self):
    leader_buf=[0 for i in range(self.n)]
    group_size=[0 for i in range(self.n)]
    for i in range(self.n):
      leader_buf[i]=self.leader(i)
      group_size[leader_buf[i]]+=1
    result=[[] for i in range(self.n)]
    for i in range(self.n):
      result[leader_buf[i]].append(i)
    result2=[]
    for i in range(self.n):
      if len(result[i])>0:
        result2.append(result[i])
    return result2

N,M=map(int,input().split())
E=[]
for i in range(M):
  E.append(list(map(lambda x:int(x)-1,input().split())))

C=list(map(lambda x:int(x)-1,input().split()))
W=list(map(int,input().split()))

G=[dsu(N) for _ in range(1<<10)]


for i in range(1<<10):
  for j in E:
    if (i>>C[j[0]]&1) and (i>>C[j[1]]&1):
      G[i].merge(j[0],j[1])

cost=[0]*(1<<10)
for i in range(1<<10):
  for j in range(10):
    if i>>j&1:
      cost[i]+=W[j]

Q=int(input())
for _ in range(Q):
  U,V=map(int,input().split())
  U-=1
  V-=1
  ans=10**11
  for i in range(1<<10):
    if G[i].same(U,V):
      ans=min(ans,cost[i])
  if ans==10**11:
    ans=-1
  print(ans)