#include <bits/stdc++.h>

using namespace std;

#define ar array
#define ll long long
typedef int uci;
#define int long long
#define F first
#define S second
typedef complex<double> cd;

seed_seq seq{
    (uint64_t) chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count(),
    (uint64_t) __builtin_ia32_rdtsc(),
    (uint64_t) (uintptr_t) make_unique<char>().get()
};
mt19937 rng(seq);
 mt19937_64 lrng(seq);

struct debugger{
    template <typename T>
    debugger& operator<<(T &a){
        #ifdef DEBUG
            cerr << a;
        #endif
        return *this;
    }
    template <typename T>
    debugger& operator<<(T &&a){
        #ifdef DEBUG
            cerr << a;
        #endif
        return *this;
    }
} deb;

const double PI = acos(-1.0);
const int MAX_N = 1e5 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;

//! function insert

//THINK FIRST, CODE SECOND
//DON'T GET STUCK ON ONE STRATEGY
//CALM DOWNNN FOR ONCE IN YOUR LIFE
//REDUCE
//COUGH E??!?!?!! O.O
//uwu i see you ryan

 struct custom_hash {
     static uint64_t splitmix64(uint64_t x) {
         // http://xorshift.di.unimi.it/splitmix64.c
         x += 0x9e3779b97f4a7c15;
         x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
         x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
         return x ^ (x >> 31);
     }
     size_t operator()(uint64_t x) const {
         static const uint64_t FIXED_RANDOM = lrng();
         return splitmix64(x + FIXED_RANDOM);
     }
 };
const int maxn = 20000;
int adj[maxn][320];
ar<int, 2> edges[200000];
int curr[maxn];
int place[maxn];
int bits[maxn];
ar<int, 2> qs[200000];
bool out[200000];
int from_room[500];
int to_room[500];
int succ[500];
int counts[maxn][500];
int upc[maxn][500];
int colorc[maxn];
int colorup[maxn];
void solve() {
    memset(adj, 0, sizeof(adj));
    memset(out, 0, sizeof(out));
    memset(upc, -1, sizeof(upc));
    memset(colorup, -1, sizeof(colorup));
    int n, m;
    cin >> n >> m;
    for(int i{}; i < n; ++i){
        cin >> curr[i];
        curr[i]--;
    }

    for(int i{}; i < n; ++i)
        place[i] = i/64;
    for(int i{}; i < n; ++i)
        bits[i] = (1ll<<(i%64));
    for(int i{}; i < m; ++i){
        cin >> edges[i][0] >> edges[i][1];
        edges[i][0]--, edges[i][1]--;
        adj[edges[i][0]][place[edges[i][1]]] |= bits[edges[i][1]];
        adj[edges[i][1]][place[edges[i][0]]] |= bits[edges[i][0]];
    }

    int q;
    cin >> q;
    for(int i{}; i < q; ++i){
        cin >> qs[i][0] >> qs[i][1];
        qs[i][0]--, qs[i][1]--;
    }

    int sq = sqrt(q);
    assert(sq < 500);
    for(int i{}; i < q; i += sq){
        int last = min(q, i+sq);
        int c{};
        for(int j = i; j < last; ++j){
            if(colorup[curr[qs[j][1]]] != i){
                colorc[curr[qs[j][1]]] = c++;
                colorup[curr[qs[j][1]]] = i;
            }
        }
        for(int j{}; j < m; ++j){
            if(colorup[curr[edges[j][0]]] == i){
                if(upc[edges[j][1]][colorc[curr[edges[j][0]]]] != i){
                    upc[edges[j][1]][colorc[curr[edges[j][0]]]] = i;
                    counts[edges[j][1]][colorc[curr[edges[j][0]]]] = 1;
                }else
                    counts[edges[j][1]][colorc[curr[edges[j][0]]]]++;
            }
            if(colorup[curr[edges[j][1]]] == i){
                if(upc[edges[j][0]][colorc[curr[edges[j][1]]]] != i){
                    upc[edges[j][0]][colorc[curr[edges[j][1]]]] = i;
                    counts[edges[j][0]][colorc[curr[edges[j][1]]]] = 1;
                }else
                    counts[edges[j][0]][colorc[curr[edges[j][1]]]]++;
            }
        }
        c = 0;
        for(int j = i; j < last; ++j){
            int f_room = curr[qs[j][0]];
            int t_room = curr[qs[j][1]];
            if(f_room == t_room)
                continue;
            int st = upc[qs[j][0]][colorc[t_room]] == i ? counts[qs[j][0]][colorc[t_room]] : 0;
            for(int k{}; k < c; ++k){
                if((adj[qs[j][0]][place[succ[k]]])&(bits[succ[k]])){
                    if(from_room[k] == t_room)
                        st--;
                    if(to_room[k] == t_room)
                        st++;
                }
            }
            if(st > 0){
                out[j] = true;
                from_room[c] = f_room;
                to_room[c] = t_room;
                succ[c++] = qs[j][0];
                curr[qs[j][0]] = t_room;
            }
        }
    }
    for(int i{}; i < q; ++i){
        if(!out[i])
            cout << "No\n";
        else
            cout << "Yes\n";
    }
}

uci main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

        // cout << "Case #" << t  << ": ";
        solve();
}

/*
    random number generator stuff
    num = rng(); gives integer number
    num = uniform_int_distribution<int>(a, b)(rng); -> bounds [a, b]
    num = uniform_real_distribution<double>(a, b)(rng); -> bounds [a, b)
    can also instantiate distributions and call on generator:
    uniform_int_distribution<int> thing(a, b);
    num = thing(rng);
*/
// struct custom_hash {
//     static uint64_t splitmix64(uint64_t x) {
//         // http://xorshift.di.unimi.it/splitmix64.c
//         x += 0x9e3779b97f4a7c15;
//         x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
//         x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
//         return x ^ (x >> 31);
//     }
//     size_t operator()(uint64_t x) const {
//         static const uint64_t FIXED_RANDOM = lrng();
//         return splitmix64(x + FIXED_RANDOM);
//     }
// };