/* -*- coding: utf-8 -*-
 *
 * 2630.cc:  No.2630 Colorful Vertices and Cheapest Paths  - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
 
using namespace std;

/* constant */

const int C = 10;
const int CBITS = 1 << C;
const int MAX_N = 10000;
const int MAX_M = 10000;
const int MAX_QN = 10000;
const long long LINF = 1LL << 62;

/* typedef */

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;

struct UFT {
  vector<int> links, ranks, sizes;
  UFT() {}

  void init(int n) {
    links.resize(n);
    for (int i = 0; i < n; i++) links[i] = i;
    ranks.assign(n, 1);
    sizes.assign(n, 1);
  }

  int root(int i) {
    int i0 = i;
    while (links[i0] != i0) i0 = links[i0];
    return (links[i] = i0);
  }

  int rank(int i) { return ranks[root(i)]; }
  int size(int i) { return sizes[root(i)]; }
  bool same(int i, int j) { return root(i) == root(j); }

  int merge(int i0, int i1) {
    int r0 = root(i0), r1 = root(i1), mr;
    if (r0 == r1) return r0;
    if (ranks[r0] == ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      ranks[r0]++;
      mr = r0;
    }
    else if (ranks[r0] > ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      mr = r0;
    }
    else {
      links[r0] = r1;
      sizes[r1] += sizes[r0];
      mr = r1;
    }
    return mr;
  }
};

/* global variables */

pii es[MAX_M], qs[MAX_QN];
int cs[MAX_N], ws[C];
ll ans[MAX_QN];
UFT uft;

/* subroutines */

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);

  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--, v--;
    es[i] = {u, v};
  }
  
  for (int i = 0; i < n; i++) scanf("%d", cs + i), cs[i]--;
  for (int i = 0; i < C; i++) scanf("%d", ws + i);

  int qn;
  scanf("%d", &qn);
  for (int i = 0; i < qn; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--, v--;
    qs[i] = {u, v};
  }

  fill(ans, ans + qn, LINF);
  for (int bits = 1; bits < CBITS; bits++) {
    ll wsum = 0;
    for (int i = 0; i < C; i++)
      wsum += (ll)ws[i] * ((bits >> i) & 1);

    uft.init(n);
    for (int i = 0; i < m; i++) {
      auto [u, v] = es[i];
      if ((bits & (1 << cs[u])) && (bits & (1 << cs[v])))
	uft.merge(u, v);
    }
    
    for (int i = 0; i < qn; i++) {
      auto [u, v] = qs[i];
      if (uft.same(u, v))
	ans[i] = min(ans[i], wsum);
    }
  }

  for (int i = 0; i < qn; i++)
    printf("%lld\n", (ans[i] < LINF) ? ans[i] : -1LL);

  return 0;
}