#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
constexpr int M = 20000;
using BS = bitset<M>;

BS c2p[M];
BS adj[M];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  VI c(n);
  rep(i, n) cin >> c[i], c[i]--, c2p[c[i]][i] = true;
  rep(_, m) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    adj[a][b] = adj[b][a] = true;
  }
  int q;
  cin >> q;
  while(q--) {
    int x, y;
    cin >> x >> y;
    x--, y--;
    if (c[x] != c[y] && (adj[x] & c2p[c[y]]).any()) {
      cout << "Yes\n";
      c2p[c[x]][x] = false;
      c[x] = c[y];
      c2p[c[x]][x] = true;
    } else {
      cout << "No\n";
    }
  }
}