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[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
        // Test();
    }
    static void Test()
    {
        var r = new Random();
        var count = 0;
        while (true)
        {
            var n = 100;
            var q = 500;
            var p = new int[n];
            for (var i = 0; i < n; ++i) p[i] = r.Next(n) + 1;
            var (m, map) = Create(n, r);
            var query = new int[q][];
            for (var i = 0; i < q; ++i) query[i] = new int[] { r.Next(n) + 1, r.Next(n) + 1 };
            // 愚直解
            var s1 = All(n, m, p, map, q, query);
            // 作成解
            var s2 = FriendsPlus(n, m, p, map, q, query);
            if (s1 != s2)
            {
                WriteLine($"{n} {m}");
                WriteLine(string.Join(" ", p));
                WriteLine(string.Join("\n", map.Select(mi => string.Join(" ", mi))));
                WriteLine(q);
                WriteLine(string.Join("\n", query.Select(qi => string.Join(" ", qi))));
                WriteLine(s1);
                WriteLine(s2);
                return;
            }
            ++count;
            if (count % 1000 == 0) WriteLine(count);
        }
    }
    static (int m, int[][] map) Create(int n, Random r)
    {
        var list = new List<int[]>();
        for (var i = 0; i < n; ++i) for (var j = i + 1; j < n; ++j) if (r.Next(3) == 0)
        {
            list.Add(new int[] { i + 1, j + 1 });
        }
        return (list.Count, list.ToArray());
    }
    static string All(int n, int m, int[] p, int[][] map, int q, int[][] query)
    {
        var fr = new UnionFindTree(n);
        foreach (var edge in map) fr.Unite(edge[0] - 1, edge[1] - 1);
        var pos = (int[]) p.Clone();
        var ans = new bool[q];
        for (var i = 0; i < q; ++i)
        {
            var x = query[i][0] - 1;
            var y = query[i][1] - 1;
            var flg = false;
            for (var f = 0; f < n; ++f) if (fr.IsSameTree(f, x))
            {
                if (pos[f] == pos[y]) flg = true;
            }
            if (flg && pos[x] != pos[y])
            {
                pos[x] = pos[y];
                ans[i] = true;
            }
        }
        return string.Join("\n", ans.Select(f => f ? "Yes" : "No"));
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var p = NList;
        var map = NArr(m);
        var q = NN;
        var query = NArr(q);
        WriteLine(FriendsPlus(n, m, p, map, q, query));
    }
    static string FriendsPlus(int n, int m, int[] p, int[][] map, int q, int[][] query)
    {
        var fr = new UnionFindTree(n + q);
        foreach (var edge in map) fr.Unite(edge[0] - 1, edge[1] - 1);

        var gw = new Dictionary<int, int>[n + q];
        for (var i = 0; i < gw.Length; ++i) gw[i] = new Dictionary<int, int>();

        var pos = Enumerable.Repeat(-1, n + q).ToArray();
        for (var i = 0; i < n; ++i)
        {
            pos[i] = p[i];
            if (gw[fr.GetRoot(i)].ContainsKey(p[i])) ++gw[fr.GetRoot(i)][p[i]];
            else gw[fr.GetRoot(i)][p[i]] = 1;
        }

        var id = new int[n];
        for (var i = 0; i < n; ++i) id[i] = i;

        var ans = new bool[q];
        for (var i = 0; i < q; ++i)
        {
            var x = query[i][0] - 1;
            var y = query[i][1] - 1;
            var gid = fr.GetRoot(x);
            var xgroup = gw[gid];
            if (pos[x] != pos[y] && xgroup.ContainsKey(pos[y]))
            {
                ans[i] = true;
                --xgroup[pos[x]];
                if (xgroup[pos[x]] == 0) xgroup.Remove(pos[x]);
                ++xgroup[pos[y]];
                pos[x] = pos[y];
            }
        }
        return string.Join("\n", ans.Select(f => f ? "Yes" : "No"));
    }
    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)];
        }
    }
}