#include <bits/stdc++.h>
#include <atcoder/all>
// url 
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=b-1;i>=a;i--)
#define all(x) (x).begin(),(x).end()
#define pb(x) push_back(x);
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
typedef long long ll;
typedef long double lld;
using namespace std;
using namespace atcoder;
using mint = static_modint<998244353>;
const ll mod=998244353;
// using mint = static_modint<1000000007>;
//const ll mod=1e9+7;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
const string zton="0123456789";
const string atoz="abcdefghijklmnopqrstuvwxyz";
const string ATOZ="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const ll inf=(1ll<<60);
// const int inf=(1<<30);
lld dist(lld x1,lld x2,lld y1,lld y2){
    lld res=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
    res=sqrt(abs(res));
    return res;
}
lld arg(lld x,lld y){
    const lld eps=1e-8;
    lld res=0;
    if(abs(x)+abs(y)<=eps)return 0.0;
    else if(abs(x)<=eps){
        if(y>=0.0)return (M_PI/2);
        else return (M_PI/2+M_PI);
    }
    else if(abs(y)<=eps){
        if(x>=0.0)return 0.0;
        else return M_PI;
    }
    res=atan2(abs(y),abs(x));
    if(x<=0&&y>=0)res=(M_PI-res);
    else if(x<=0&&y<=0)res+=(M_PI);
    else if(x>=0&&y<=0)res=(M_PI*2-res);
    return res;
}
ll gcd(ll a,ll b){
    if(a==0||b==0)return a+b;
    ll r;
    r=a%b;
    if(r==0){
        return b;
    }
    else{
        return gcd(b,r);
    }
}
typedef pair<ll,int> P;

int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N,M;cin >> N >> M;
    int p[N];
    rep(i,0,N){
        cin >> p[i];
        p[i]--;
    }
    vector<int> G[N];
    rep(i,0,M){
        int a,b;cin >> a >> b;a--;b--;
        G[a].pb(b);
        G[b].pb(a);
    }
    int color[N];
    int n=0;
    vector<int> red;
    map<int,int> inv_red;
    rep(i,0,N){
        if(G[i].size()>=140){
            color[i]=1;
            inv_red[n]=i;
            red.pb(i);
            n++;
        }
        else{
            color[i]=0;
        }
    }
    int cnt[n][N];
    rep(i,0,n){
        rep(j,0,N){
            cnt[i][j]=0;
        }
        for(int j:G[red[i]]){
            cnt[i][p[j]]++;
        }
    }
    vector<int> G2[N];
    rep(i,0,N){
        for(int j:G[i]){
            if(color[j]){
                G2[i].pb(j);
            }
        }
    }
    vector<bool> ans;
    int Q;cin >> Q;
    rep(_,0,Q){
        int x,y;cin >> x >> y;
        x--;y--;
        if(p[x]==p[y]){
            ans.pb(false);
            continue;
        }
        if(color[x]==1){
            if(cnt[inv_red[p[x]]][p[y]]>0){
                for(int i:G2[x]){
                    cnt[inv_red[p[x]]][p[i]]--;
                    cnt[inv_red[p[i]]][p[x]]--;
                }
                ans.pb(true);
                p[x]=p[y];
                for(int i:G2[x]){
                    cnt[inv_red[p[x]]][p[i]]++;
                    cnt[inv_red[p[i]]][p[x]]++;
                }
            }
            else{
                ans.pb(false);
            }
        }
        else{
            bool flag=false;
            for(int i:G[x]){
                if(p[i]==p[y]){
                    flag=true;
                    break;
                }
            }
            if(flag){
                for(int i:G2[x]){
                    cnt[inv_red[p[i]]][p[x]]--;
                }
                ans.pb(true);
                p[x]=p[y];
                for(int i:G2[x]){
                    cnt[inv_red[p[i]]][p[x]]++;
                }
            }
            else{
                ans.pb(false);
            }
        }
    }
    for(bool flag:ans){
        if(flag)cout << "Yes" << endl;
        else cout << "No" << endl;
    }
}