using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var map = NMap(m);
        c = NMi;
        var w = NList;
        var q = NN;
        var query = NMap(q);
        var INF = long.MaxValue / 2;
        var ans = Enumerable.Repeat(INF, q).ToArray();
        var bitmax = 1024;
        for (var b = 1; b < bitmax; ++b)
        {
            var tmp = b;
            var list = new bool[10];
            var cost = 0L;
            for (var i = 0; i < 10; ++i)
            {
                if (tmp % 2 == 1)
                {
                    list[i] = true;
                    cost += w[i];
                }
                tmp >>= 1;
            }
            var uf = new UnionFindTree(n);
            foreach (var edge in map)
            {
                if (list[c[edge[0]]] && list[c[edge[1]]]) uf.Unite(edge[0], edge[1]);
            }
            for (var i = 0; i < q; ++i)
            {
                if (uf.IsSameTree(query[i][0], query[i][1])) ans[i] = Math.Min(ans[i], cost);
            }
        }
        WriteLine(string.Join("\n", ans.Select(ai => ai == INF ? -1 : ai)));
    }
    class UnionFindTree
    {
        int[] roots;
        public UnionFindTree(int size)
        {
            roots = new int[size];
            for (var i = 0; i < size; ++i) roots[i] = -1;
        }
        public int GetRoot(int a)
        {
            if (roots[a] < 0) return a;
            return roots[a] = GetRoot(roots[a]);
        }
        public bool IsSameTree(int a, int b)
        {
            return GetRoot(a) == GetRoot(b);
        }
        public bool Unite(int a, int b)
        {
            var x = GetRoot(a);
            var y = GetRoot(b);
            if (x == y) return false;
            if (-roots[x] < -roots[y]) { var tmp = x; x = y; y = tmp; }
            roots[x] += roots[y];
            roots[y] = x;
            return true;
        }
        public int GetSize(int a)
        {
            return -roots[GetRoot(a)];
        }
    }
}