#include using namespace std; struct iofast_t { iofast_t() { ios::sync_with_stdio(false); cin.tie(nullptr); } } iofast; struct uns_t {} uns; template auto vec(Element init, Head arg, Args ...args) { if constexpr (sizeof...(Args) == 0) return vector(arg, init); else return vector(arg, vec(init, args...)); } template auto vec(uns_t, Head arg, Args ...args) { return vec(Element(), arg, args...); } template auto distance(const Container &c, decltype(begin(c)) iter) { return distance(begin(c), iter); } template ::value_type>> auto isort(RIter first, RIter last, Compare comp = Compare()) { vector i(distance(first, last)); iota(begin(i), end(i), 0); sort(begin(i), end(i), [&](auto x, auto y) { return comp(*(first + x), *(first + y)); }); return i; } template typename, typename = void_t<>> struct detect : false_type {}; template typename Check> struct detect>> : true_type {}; template typename Check> constexpr inline bool detect_v = detect::value; template using has_member_sort = decltype(declval().sort()); template > auto sorted(Container c, Compare comp = Compare()) { if constexpr (detect_v) { c.sort(comp); return c; } else { sort(begin(c), end(c), comp); return c; } } template > auto uniqued(Container c, Compare comp = Compare()) { c.erase(unique(begin(c), end(c), comp), end(c)); return c; } template > T &chmin(T &l, T r, Compare &&f = less()) { return l = min(l, r, f); } template > T &chmax(T &l, T r, Compare &&f = less()) { return l = max(l, r, f); } template constexpr auto fix(F &&f) noexcept { return [f = std::tuple(std::forward(f))](auto &&...args) mutable { return std::get<0>(f)(fix(std::get<0>(f)), std::forward(args)...); }; } int main() { int n, m; cin >> n >> m; auto p = vec(uns, n); for (auto &e : p) { cin >> e; --e; } auto g = vec(uns, n, 0); for (int i = 0; i < m; ++i) { int a, b; cin >> a >> b; --a; --b; g[a].push_back(b); g[b].push_back(a); } const int t = round(ceil(sqrt(m))); auto h = vec(uns, n, 0); auto nei = vec(uns, n, 0); for (int i = 0; i < n; ++i) { if (size(g[i]) < t) { continue; } nei[i] = vec(0, n); for (auto v : g[i]) { h[i].push_back(v); ++nei[i][p[v]]; // t <= size(g[i]) な頂点 i から出ている辺はすべて双方向にしたい // ここで無条件に v -> i な辺を追加すると t <= size(g[v]) であったとき二重辺になる // あとで unique してもいいが、こっちのほうが楽なので if (size(g[v]) < t) { h[v].push_back(i); } } } int q; cin >> q; while (q--) { int x, y; cin >> x >> y; --x; --y; if (p[x] == p[y]) { cout << "No" << '\n'; continue; } if (size(g[x]) < t) { bool f = false; for (auto v : g[x]) { f |= (p[v] == p[y]); } if (!f) { cout << "No" << '\n'; continue; } cout << "Yes" << '\n'; // t <= size(g[v]) な頂点たち向けの更新 for (auto v : h[x]) { if (t <= size(g[v])) { --nei[v][p[x]]; ++nei[v][p[y]]; } } p[x] = p[y]; continue; } if (nei[x][p[y]] == 0) { cout << "No" << '\n'; continue; } cout << "Yes" << '\n'; // t <= size(g[v]) な頂点たち向けの更新 for (auto v : h[x]) { if (t <= size(g[v])) { --nei[v][p[x]]; ++nei[v][p[y]]; } } p[x] = p[y]; } cout << flush; }