import sys input = sys.stdin.readline #https://github.com/not522/ac-library-python/blob/master/atcoder/dsu.py import typing class DSU: ''' Implement (union by size) + (path halving) Reference: Zvi Galil and Giuseppe F. Italiano, Data structures and algorithms for disjoint set union problems ''' def __init__(self, n: int = 0) -> None: self._n = n self.parent_or_size = [-1] * n def merge(self, a: int, b: int) -> int: assert 0 <= a < self._n assert 0 <= 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: int, b: int) -> bool: assert 0 <= a < self._n assert 0 <= b < self._n return self.leader(a) == self.leader(b) def leader(self, a: int) -> int: assert 0 <= a < self._n parent = self.parent_or_size[a] while parent >= 0: if self.parent_or_size[parent] < 0: return parent self.parent_or_size[a], a, parent = ( self.parent_or_size[parent], self.parent_or_size[parent], self.parent_or_size[self.parent_or_size[parent]] ) return a def size(self, a: int) -> int: assert 0 <= a < self._n return -self.parent_or_size[self.leader(a)] def groups(self) -> typing.List[typing.List[int]]: leader_buf = [self.leader(i) for i in range(self._n)] result: typing.List[typing.List[int]] = [[] for _ in range(self._n)] for i in range(self._n): result[leader_buf[i]].append(i) return list(filter(lambda r: r, result)) N, M = map(int, input().split()) A, B = [-1] * M, [-1] * M for i in range(M): A[i], B[i] = map(int, input().split()) A[i], B[i] = A[i] - 1, B[i] - 1 C = list(map(int, input().split())) for i in range(N): C[i] -= 1 W = list(map(int, input().split())) K = 1 << 10 U = [DSU(N) for _ in range(K)] cost = [0] * K for s in range(K): for a, b in zip(A, B): if ((s >> C[a]) & 1) and ((s >> C[b]) & 1): U[s].merge(a, b) for i in range(10): if (s >> i) & 1: cost[s] += W[i] Q = int(input()) inf = 10 ** 18 for _ in range(Q): ans = inf u, v = map(int, input().split()) u, v = u - 1, v - 1 if not U[-1].same(u, v): print(-1) continue for i in range(K): if U[i].same(u, v): ans = min(ans, cost[i]) print(ans) if ans != inf else print(-1)