#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
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; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}


int main(){  
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N,M; cin >> N >> M;
  vector<bitset<20000>> P(N);
  vector<bitset<20000>> B(N);
  vector<int> W(N);
  rep(i,N){
    int a; cin >> a; a--;
    W[i] = a;
    P[a].set(i);
  }
  rep(i,M){
    int a,b; cin >> a >> b; a--; b--;
    if(a==b) continue;
    B[a].set(b);
    B[b].set(a);
  }
  int Q; cin >> Q;
  while(Q--){
    int x,y; cin >> x >> y; x--; y--;
    if(W[x]==W[y]) cout << "No\n";
    else{
      if((P[W[y]]&B[x]).any()){
        cout << "Yes\n";
        P[W[x]].reset(x);
        P[W[y]].set(x);
        W[x] = W[y];
      }
      else cout << "No\n";
    }
  }
  return 0;
}