#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>>>;

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

    int n, m; cin >> n >> m;
    vector<map<int, int>> p(n);
    vector<int> now_t(n, 0);
    rep(i, n) cin >> p[i][0];
    Graph<int> G(n);
    for(int i=0; i<m; i++){
        int u, v; cin >> u >> v;
        u--; v--;
        G[u].pb(Edge<int>(v));
        G[v].pb(Edge<int>(u));
    }

    int sq = 500;
    vector<multiset<int>> mst(n);
    vector<vector<int>> check_t(n);
    vector<map<int, int>> G_mp(n);
    for(int v=0; v<n; v++) for(Edge<int> e : G[v]) mst[v].insert(p[e.to][0]);
    for(int v=0; v<n; v++) for(Edge<int> e : G[v]) check_t[v].pb(0);
    for(int v=0; v<n; v++) for(int i=0; i<(int)G[v].size(); i++) G_mp[v][G[v][i].to]=i;

    Graph<int> HD(n);
    for(int v=0; v<n; v++) for(Edge<int> e : G[v]) if((int)G[e.to].size()>sq) HD[v].pb(Edge<int>(e.to));

    int q; cin >> q;
    int now = 0;
    while(q--){
        now++;
        int x, y; cin >> x >> y;
        x--; y--;

        //場所の更新を受け取る
        for(Edge<int> e : HD[x]){
            int i = G_mp[x][e.to];
            //更新条件
            if(check_t[x][i] != now_t[e.to]){
                mst[x].erase(mst[x].lower_bound(p[e.to][check_t[x][i]])); //消去
                mst[x].insert(p[e.to][now_t[e.to]]);
                check_t[x][i] = now_t[e.to];
            }
        }

        //判定Phase
        if(mst[x].find(p[y][now_t[y]]) == mst[x].end()){
            cout << "No" << '\n';
            continue;
        }
        if(p[x][now_t[x]] == p[y][now_t[y]]){
            cout << "No" << '\n';
            continue;
        }
        cout << "Yes" << '\n';

        //xの場所の更新
        if((int)G[x].size() <= sq){
            for(Edge<int> e : G[x]){
                int i = G_mp[e.to][x];
                mst[e.to].erase(p[x][check_t[e.to][i]]);
            }
        }

        now_t[x] = now;
        p[x][now] = p[y][now_t[y]];
        if((int)G[x].size() <= sq){
            for(Edge<int> e : G[x]){
                mst[e.to].insert(p[x][now_t[x]]);
                int i = G_mp[e.to][x];
                check_t[e.to][i] = now_t[x];
            }
        }
    }
}