#include <bits/stdc++.h>

using namespace std;

using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); i++)
template<class T> using V = vector<T>;

template<class T>
ostream &operator<<(ostream &os, const V<T> &v) {
    os << "[ ";
    for (auto &vi: v) os << vi << ", ";
    return os << "]";
}

template<class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    return os << "{ " << p.first << ", " << p.second << "}";
}

#ifdef LOCAL
#define show(x) cerr << __LINE__ << " : " << #x << " = " << x << endl;
#else
#define show(x) true
#endif

struct UF {
    V<int> par;

    UF() {}
    UF(int n) : par(n, -1) {}

    int leader(int x) { return par[x] < 0 ? x : par[x] = leader(par[x]); }

    bool merge(int x, int y) {
        x = leader(x), y = leader(y);
        if (x == y) return false;
        if (par[x] > par[y]) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        return true;
    }

    bool same(int x, int y) { return leader(x) == leader(y); }

    int size(int x) { return -par[leader(x)]; }
};

int main() {
    int N, M;
    cin >> N >> M;
    vector<int> P(N);
    REP(i, N) {
        cin >> P[i];
        P[i]--;
    }
    UF uf(N);
    vector<int> A(M), B(M);
    REP(i, M) {
        cin >> A[i] >> B[i];
        A[i]--, B[i]--;
        uf.merge(A[i], B[i]);
    }
    vector<int> L(N);
    REP(i, N) L[i] = uf.leader(i);
    show(L);
    show(P);
    vector<map<int, int>> S(N);
    REP(i, N) S[P[i]][L[i]]++;
    int Q;
    cin >> Q;
    REP(qq, Q) {
        int X, Y;
        cin >> X >> Y;
        X--, Y--;
        if (P[X] == P[Y]) {
            cout << "No" << '\n';
            continue;
        }
        int ld = uf.leader(X);
        if (S[P[Y]][ld] > 0) {
            cout << "Yes" << '\n';
            // move
            if (--S[P[X]][ld] == 0) S[P[X]].erase(ld);
            S[P[Y]][ld]++;
            P[X] = P[Y];
        } else {
            cout << "No" << '\n';
        }
        show(P);
    }
    return 0;
}