#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <array>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <bitset>

#include <cmath>
#include <math.h>
#include <climits>

#pragma warning(push)
#pragma warning(disable:26498 26450 26451 26812)
#include "atcoder/all"
#pragma warning(pop)

//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
// std::fixed << std::setprecision(10) <<

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;

const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPI(i, init, n) for (ll i = init; i < (n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)

using vl = vector<ll>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;

using vvl = vector<vector<ll>>;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const int n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const int n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;

const char* YES = "Yes";
const char* NO = "No";
void yn(bool f) { std::cout << (f ? YES : NO) << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };

const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
template<class T, class U> bool chmin(T& a, const U& b) { a = min(a, b); return b == a; }
template<class T, class U> bool chmax(T& a, const U& b) { a = max(a, b); return b == a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };

template <typename T>
vector<pair<T, T>> prime_factor(T n) {
	vector<pair<T, T>> ret;
	for (T i = 2; i * i <= n; i++) {
		if (n % i != 0) continue;
		T tmp = 0;
		while (n % i == 0) {
			tmp++;
			n /= i;
		}
		ret.push_back(make_pair(i, tmp));
	}
	if (n != 1) ret.push_back(make_pair(n, 1));
	return ret;
}

mint fac[3000001], finv[3000001], inv[3000001];

void setup() {
    const int MOD = mint::mod();
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i <= 3000000; i++) {
        fac[i] = fac[i - 1] * i;
        inv[i] = (mint)MOD - inv[MOD % i] * (MOD / i);
        finv[i] = finv[i - 1] * inv[i];
    }
}

mint binom(int n, int r) {
    if (n < r or n < 0 or r < 0) return mint::raw(0);
    return fac[n] * finv[r] * finv[n - r];
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

	setup();
 
    ll n, m;
    cin >> n >> m;

    VLI(p, n);

    ll bo = ll(sqrt(n));

    vector<map<ll, ll>> cmv(n, map<ll, ll>()); //頂点nが移動可能な頂点
    vector<vector<ll>> ccv(n, vector<ll>()); //頂点nのフレンドのうち、都度問い合わせ必要な頂点

    vvl ed(n, vl());
    REP(i, m) {
		ll a, b;
		cin >> a >> b;
		a--; b--;

        ed[a].push_back(b);
        ed[b].push_back(a);
	}

    REP(i, n) {
        for (auto& x : ed[i]) {
            if (ed[x].size() > bo) {
                ccv[i].push_back(x);
            }
            else {
                cmv[i][p[x]]++;
            }
		}
    }

    ll q;
    cin >> q;

    REP(i, q) {
    	ll x, y;
		cin >> x >> y;
        x--; y--;

        if (p[x] == p[y]) {
            cout << "No" << endl;
            continue;
        }

        bool move = false;
        ll from = p[x];
        ll to = p[y];
        if (cmv[x][to] != 0) {
            move = true;
        }
        else {
            for (auto& z : ccv[x]) {
                if (p[z] == to) {
					move = true;
					break;
				}
			}
		}

        yn(move);

        if (move) {
            p[x] = to;
            if (ed[x].size() > bo) {
                ; //何もしない
            }
            else {
                //自分のフレンドの移動可能範囲を書き換える
                REPE(e, ed[x]) {
                    cmv[e][from]--;
                    cmv[e][to]++;
                }
            }

        }
    }

    return 0;
}