#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60;
const int IINF = 1 << 30 - 1;

template<typename T> struct Edge{
    int to; T w;
    Edge(int to_, T w_=1){
        to = to_;
        w=w_;
    }
};
template<typename T> using Tree = vector<vector<Edge<T>>>;
template<typename T> using Graph = vector<vector<Edge<T>>>;
/* 容量&重み付きエッジ for Dinic */
template<typename T> struct REdge{
    int to;
    T cap;
    T cost;
    int rev;
    REdge(int to_, T cap_, T cost_=1){
        to = to_;
        cap = cap_;
        cost = cost_;
    }
    
    REdge(int to_, T cap_, T cost_, int rev_){
        to = to_;
        cap = cap_;
        cost = cost_;
        rev = rev_;
    }
};

/* 残余グラフ for Dinic */
template<typename T> using RGraph = vector<vector<REdge<T>>>;

const int MAX = 20000;

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

    short th = 200; //threshold
    short n; cin >> n;
    int m; cin >> m;
    vector<short> p(n);
    for(short i=0; i<n; i++) cin >> p[i];

    Graph<short> G(n);
    for(int i=0; i<m; i++){
        short u, v; cin >> u >> v;
        u--; v--;
        G[u].pb(Edge<short>(v));
        G[v].pb(Edge<short>(u));
    }
    Graph<short> HD(n);
    for(short v=0; v<n; v++) for(Edge<short> e : G[v]) if((short)G[e.to].size()>th) HD[v].pb(Edge<short>(e.to));

    vector<vector<short>> mark_p(n);
    vector<unordered_map<short, short>> inv(n);
    vector<unordered_map<short, short>> cnt(n);
    for(short v=0; v<n; v++) for(Edge<short> e : G[v]) cnt[v][p[e.to]]++;
    for(short v=0; v<n; v++) for(Edge<short> e : G[v]) mark_p[v].pb(p[e.to]);
    for(short v=0; v<n; v++) for(short i=0; i<(short)G[v].size(); i++) inv[v][G[v][i].to]=i;

    int q; cin >> q;
    while(q--){
        int x, y; cin >> x >> y;
        x--; y--;

        //場所の更新を受け取る
        for(Edge<short> e : HD[x]){
            short i = inv[x][e.to];
            cnt[x][mark_p[x][i]]--;
            cnt[x][p[e.to]]++;
            mark_p[x][i] = p[e.to];
        }

        //判定Phase
        if(cnt[x][p[y]]==0 || p[x] == p[y]){
            cout << "No" << '\n';
            continue;
        }
        cout << "Yes" << '\n';

        //xの場所の更新
        if((short)G[x].size() <= th){
            for(Edge<short> e : G[x]){
                short i = inv[e.to][x];
                cnt[e.to][mark_p[e.to][i]]--;
                cnt[e.to][p[y]]++;
                mark_p[e.to][i] = p[y];
            }
        }

        p[x] = p[y];
    }
}