#if __INCLUDE_LEVEL__ == 0 #include using namespace std; #include __BASE_FILE__ namespace std::ranges::views { namespace { void solve() { int n, m; cin >> tie(n, m); vector p(n); vector> h(n); for (int i : iota(0, n)) { cin >> p[i]; --p[i]; h[p[i]][i] = 1; } vector> g(n); while (m--) { int a, b; cin >> tie(a, b); --a, --b; g[a][b] = 1; g[b][a] = 1; } int q; cin >> q; while (q--) { int x, y; cin >> tie(x, y); --x, --y; bool ans = [&]() -> bool { if (p[x] == p[y]) { return false; } if ((g[x] & h[p[y]]).none()) { return false; } h[p[x]][x] = 0; p[x] = p[y]; h[p[x]][x] = 1; return true; }(); cout << (ans ? "Yes\n" : "No\n"); } } } // namespace } // namespace std::ranges::views using views::solve; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); solve(); } #else // __INCLUDE_LEVEL__ namespace std { template istream& operator>>(istream& is, pair& p) { return is >> p.first >> p.second; } template istream& operator>>(istream& is, tuple& t) { return apply([&is](auto&... xs) -> istream& { return (is >> ... >> xs); }, t); } template istream& operator>>(istream& is, tuple&& t) { return is >> t; } template >* = nullptr> auto operator>>(istream& is, R&& r) -> decltype(is >> *begin(r)) { for (auto&& e : r) { is >> e; } return is; } template ostream& operator<<(ostream& os, const pair& p) { return os << p.first << ' ' << p.second; } template ostream& operator<<(ostream& os, const tuple& t) { auto f = [&os](const auto&... xs) -> ostream& { [[maybe_unused]] auto sep = ""; ((os << exchange(sep, " ") << xs), ...); return os; }; return apply(f, t); } template >* = nullptr> auto operator<<(ostream& os, R&& r) -> decltype(os << *begin(r)) { auto sep = ""; for (auto&& e : r) { os << exchange(sep, " ") << e; } return os; } } // namespace std #endif // __INCLUDE_LEVEL__