#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int N = 20000;
  int n, m; cin >> n >> m;
  vector<int> p(n);
  vector<bitset<N>> worlds(n);
  REP(i, n) {
    cin >> p[i]; --p[i];
    worlds[p[i]].set(i);
  }
  vector<bitset<N>> fri(n);
  while (m--) {
    int a, b; cin >> a >> b; --a; --b;
    fri[a].set(b);
    fri[b].set(a);
  }
  int q; cin >> q;
  while (q--) {
    int x, y; cin >> x >> y; --x; --y;
    if (p[x] != p[y] && (fri[x] & worlds[p[y]]).any()) {
      cout << "Yes\n";
      worlds[p[x]].reset(x);
      p[x] = p[y];
      worlds[p[x]].set(x);
    } else {
      cout << "No\n";
    }
  }
  return 0;
}