//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <cassert>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <complex>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
using lg = long long;
using pii = pair<int, int>;
using pll = pair<lg, lg>;
#define TEST clog << "TEST" << endl
#define IINF 2147483647
#define LLINF 9223372036854775807LL
#define AMARI 998244353
//#define AMARI 1000000007
#define TEMOTO ((sizeof(long double) == 16) ? false : true)
#define TIME_LIMIT 1980 * (TEMOTO ? 1 : 1000)
#define el '\n'
#define El '\n'

long long ococo_gcd(long long a, long long b) {
    if (a < b) {
        long long kari = b;
        b = a;
        a = kari;
    }
    long long ans = a;
    while (a % b) {
        long long kari = b;
        b = a % b;
        a = kari;
    }
    return min(a, b);
}

#define MULTI_TEST_CASE false
void solve(void) {
    int n, m;
    cin >> n >> m;
    vector<int> p(n);
    for (int i = 0; i < n; i++) {
        cin >> p[i];
        p[i]--;
    }
    vector<vector<int>> g(n);
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--; b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    int kizyun = sqrt(m);
    vector<int> ooi;
    vector<int> gyaku_o(n);
    int cnt = 0;
    for (int i = 0; i < n; i++)if (g[i].size() >= kizyun) {
        ooi.push_back(i);
        gyaku_o[i] = cnt;
        cnt++;
    }
    vector<vector<int>> assyuku(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < g[i].size(); j++) {
            vector<int>::iterator it = lower_bound(ooi.begin(), ooi.end(), g[i][j]);
            if (it != ooi.end() && *it == g[i][j]) {
                assyuku[i].push_back(g[i][j]);
            }
        }
    }
    //can_move[i][j] = エトワーニュくんooi[i]がワールドyに行けるかどうか
    vector<vector<int>> can_move(ooi.size(), vector<int>(n,0));
    for (int i = 0; i < ooi.size(); i++) {
        for (int j = 0; j < g[ooi[i]].size(); j++) {
            int fr = ooi[i], to = g[ooi[i]][j];
            can_move[i][p[to]]++;
        }
    }
    int q;
    cin >> q;
    while (q--) {
        if (TEMOTO) {
            for (int i = 0; i < n; i++)clog << p[i] << ' ';
            clog << el;
        }
        int x, y;
        cin >> x >> y;
        x--; y--;
        if (p[x] == p[y]) {
            cout << "No" << el;
            continue;
        }
        //x→yが可能かどうか
        if (g[x].size() >= kizyun) {
            if (can_move[gyaku_o[x]][p[y]] >= 1) {
                cout << "Yes" << el;
                for (int i = 0; i < assyuku[x].size(); i++) {
                    can_move[gyaku_o[assyuku[x][i]]][p[x]]--;
                    can_move[gyaku_o[assyuku[x][i]]][p[y]]++;
                }
                p[x] = p[y];
                continue;
            }
            cout << "No" << El;
            continue;
        }
        if (g[x].size() < kizyun) {
            bool cm = false;
            for (int i = 0; i < g[x].size(); i++) {
                if (p[g[x][i]] == p[y]) {
                    cm = true;
                    break;
                }
            }
            if (cm) {
                cout << "Yes" << el;
                for (int i = 0; i < assyuku[x].size(); i++) {
                    can_move[gyaku_o[assyuku[x][i]]][p[x]]--;
                    can_move[gyaku_o[assyuku[x][i]]][p[y]]++;
                }
                p[x] = p[y];
                continue;
            }
            cout << "No" << el;
            continue;
        }
    }
    return;
}

void calc(void) {
    return;
}

int main(void) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    calc();
    int t = 1;
    if (MULTI_TEST_CASE)cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}