#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

const int SQRT = 128;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, M;
    cin >> N >> M;
    vector<int> P(N);
    for (int& x : P) cin >> x, x--;
    vector<vector<int>> G(N);
    for (; M--;) {
        int A, B;
        cin >> A >> B;
        A--, B--;
        G[A].emplace_back(B);
        G[B].emplace_back(A);
    }

    vector<vector<int>> big(N);
    vector<vector<int>> cnt(N);
    for (int i = 0; i < N; i++) {
        if (int(G[i].size()) > SQRT) {
            cnt[i].resize(N);
        }
    }
    for (int v = 0; v < N; v++) {
        for (int& u : G[v]) {
            if (int(G[u].size()) > SQRT) {
                big[v].emplace_back(u);
                cnt[u][P[v]]++;
            }
        }
    }
    auto query = [&](int X, int Y) -> bool {
        int to = P[Y];
        if (P[X] == to) return false;
        bool ok = false;
        if (int(G[X].size()) > SQRT) {
            if (cnt[X][to] > 0) {
                ok = true;
            }
        } else {
            for (int& Z : G[X]) {
                if (P[Z] == to) {
                    ok = true;
                    break;
                }
            }
        }
        if (not ok) return false;
        for (int& Z : big[X]) cnt[Z][P[X]]--;
        P[X] = to;
        for (int& Z : big[X]) cnt[Z][P[X]]++;
        return true;
    };

    int Q;
    cin >> Q;
    for (; Q--;) {
        int X, Y;
        cin >> X >> Y;
        cout << (query(--X, --Y) ? "Yes\n" : "No\n");
    }
    return 0;
}