import io import sys from collections import defaultdict, deque, Counter from itertools import permutations, combinations, accumulate from heapq import heappush, heappop from bisect import bisect_right, bisect_left from math import gcd import math _INPUT = """\ 6 4 4 1 2 2 3 3 4 4 1 1 1 2 3 1 2 3 4 5 6 7 8 9 10 3 1 2 1 3 1 4 2 0 1 1 1 100 100 100 100 100 100 100 100 100 1 1 2 5 5 1 2 2 3 2 3 3 4 4 5 1 4 5 9 10 1000000000 1 1 1000000000 1000000000 1 1 1 1000000000 1000000000 4 1 5 2 3 1 2 1 5 """ def solve(test): N,M=map(int, input().split()) G=[[] for _ in range(N)] for _ in range(M): a,b=map(lambda x:int(x)-1, input().split()) G[a].append(b) G[b].append(a) C=list(map(lambda x:int(x)-1, input().split())) W=list(map(int,input().split())) tmp=[[-1]*N for _ in range(1<<10)] cost=[sum(W[i] for i in range(10) if (_>>i)&1) for _ in range(1<<10)] for i in range(1<<10): c=[1 if (i>>j)&1 else 0 for j in range(10)] used=[0]*N parent=[-1]*N now=0 for j in range(N): if used[j]==1: continue st=[j] while st: v=st.pop() tmp[i][v]=now if used[v]==1: continue used[v]=1 if c[C[v]]==0: continue for u in G[v]: if u==parent[v] or c[C[u]]==0: continue parent[u]=v st.append(u) now+=1 Q=int(input()) for _ in range(Q): u,v=map(lambda x:int(x)-1, input().split()) ans=1<<34 for i in range(1<<10): if tmp[i][u]!=-1 and tmp[i][u]==tmp[i][v]: ans=min(ans,cost[i]) if ans==1<<34: ans=-1 print(ans) def random_input(): from random import randint,shuffle N=randint(1,10) M=randint(1,N) A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)] shuffle(A) return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3 def simple_solve(): return [] def main(test): if test==0: solve(0) elif test==1: sys.stdin = io.StringIO(_INPUT) case_no=int(input()) for _ in range(case_no): solve(0) else: for i in range(1000): sys.stdin = io.StringIO(random_input()) x=solve(1) y=simple_solve() if x!=y: print(i,x,y) print(*[line for line in sys.stdin],sep='') break #0:提出用、1:与えられたテスト用、2:ストレステスト用 main(0)