#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<int>pos(n);
	vector<bitset<20000>>fir(n);
	vector<bitset<20000>>mem(n);
	rep(i, n) {
		cin >> pos[i];
		pos[i]--;
		mem[pos[i]][i] = 1;
	}
	rep(i, m) {
		int x, y; cin >> x >> y;
		x--, y--;
		fir[x][y] = 1;
		fir[y][x] = 1;
	}
	int q; cin >> q;
	while (q--) {
		int x, y; cin >> x >> y;
		x--, y--;
		if (pos[x] == pos[y]) {
			cout << "No" << endl;
			continue;
		}
		auto cnt = (fir[x] & mem[pos[y]]).count();
		if (!cnt) {
			cout << "No" << endl;
			continue;
		}
		cout << "Yes" << endl;
		mem[pos[x]][x] = 0;
		pos[x] = pos[y];
		mem[pos[x]][x] = 1;
	}
	return 0;
}