#![allow(non_snake_case, unused_imports, unused_must_use)]
use std::io::{self, prelude::*};
use std::str;

fn main() {
    let (stdin, stdout) = (io::stdin(), io::stdout());
    let mut scan = Scanner::new(stdin.lock());
    let mut out = io::BufWriter::new(stdout.lock());

    macro_rules! input {
        ($T: ty) => {
            scan.token::<$T>()
        };
        ($T: ty, $N: expr) => {
            (0..$N).map(|_| scan.token::<$T>()).collect::<Vec<_>>()
        };
    }

    let N = input!(usize);
    let M = input!(usize);
    let edges = (0..M)
        .map(|_| (input!(usize) - 1, input!(usize) - 1))
        .collect::<Vec<_>>();

    let C = (0..N).map(|_| input!(usize) - 1).collect::<Vec<_>>();
    let W = input!(usize, 10);

    let Q = input!(usize);
    let mut query = vec![];
    let mut ans = vec![usize::MAX; Q];

    for _ in 0..Q {
        let (u, v) = (input!(usize) - 1, input!(usize) - 1);
        query.push((u, v));
    }

    for s in 0..1 << 10 {
        let mut uf = UnionFind::new(N);

        let mut cost = 0;

        for i in 0..10 {
            if (s >> i) & 1 == 1 {
                cost += W[i];
            }
        }

        for &(u, v) in edges.iter() {
            if (s >> C[u]) & 1 == 1 && (s >> C[v]) & 1 == 1 {
                uf.unite(u, v);
            }
        }

        for (i, &(u, v)) in query.iter().enumerate() {
            if uf.issame(u, v) {
                ans[i] = std::cmp::min(ans[i], cost);
            }
        }
    }

    for a in ans {
        if a == usize::MAX {
            writeln!(out, "-1");
        } else {
            writeln!(out, "{}", a);
        }
    }
}

pub struct UnionFind {
    size: usize,
    par: Vec<usize>,
    rank: Vec<usize>,
    cnt: Vec<usize>,
}

impl UnionFind {
    /// generate unionfind has given size
    pub fn new(size: usize) -> Self {
        return Self {
            size: size,
            par: vec![size; size],
            rank: vec![0; size],
            cnt: vec![1; size],
        };
    }

    /// check whether set s1 (∋ a) and set s2 (∋ b) are equal
    pub fn issame(&mut self, a: usize, b: usize) -> bool {
        assert!(a < self.size && b < self.size);
        return self.root(a) == self.root(b);
    }

    /// unite set s1 (∋ a) and set s2 (∋ b)
    pub fn unite(&mut self, mut a: usize, mut b: usize) {
        a = self.root(a);
        b = self.root(b);

        if a != b {
            if self.rank[a] < self.rank[b] {
                std::mem::swap(&mut a, &mut b);
            }
            self.par[b] = a;

            if self.rank[a] == self.rank[b] {
                self.rank[a] += 1;
            }

            self.cnt[a] += self.cnt[b];
        }
    }

    /// get the size of set s1 (∋ a)
    pub fn size(&mut self, x: usize) -> usize {
        let r = self.root(x);
        return self.cnt[r];
    }

    fn root(&mut self, x: usize) -> usize {
        if self.par[x] == self.size {
            return x;
        } else {
            self.par[x] = self.root(self.par[x]);
            return self.par[x];
        }
    }
}

struct Scanner<R> {
    reader: R,
    buf_str: Vec<u8>,
    buf_iter: str::SplitWhitespace<'static>,
}
impl<R: BufRead> Scanner<R> {
    fn new(reader: R) -> Self {
        Self {
            reader,
            buf_str: vec![],
            buf_iter: "".split_whitespace(),
        }
    }
    fn token<T: str::FromStr>(&mut self) -> T {
        loop {
            if let Some(token) = self.buf_iter.next() {
                return token.parse().ok().expect("Failed parse");
            }
            self.buf_str.clear();
            self.reader
                .read_until(b'\n', &mut self.buf_str)
                .expect("Failed read");
            self.buf_iter = unsafe {
                let slice = str::from_utf8_unchecked(&self.buf_str);
                std::mem::transmute(slice.split_whitespace())
            }
        }
    }
}