问题 A: 亲戚

#include<bits/stdc++.h>
using namespace std;
const int maxN = 20005;
int fa[maxN];
int n;
void init()
{
    for (int i = 1; i <= n; i++)
    {
        fa[i] = i;
    }
}
int Find(int x)
{
    if (fa[x] != x)
    {
        fa[x] = Find(fa[x]);
    }
    return fa[x];
}
void Merge(int x, int y)
{
    x = Find(x);
    y = Find(y);
    if (x != y)
    {
        fa[x] = y;
    }
}
int main()
{
    int m;
    scanf("%d%d", &n, &m);
    init();
    for (int i = 1; i <= m; i++)
    {
        int a, b;
        scanf("%d%d", &a, &b);
        Merge(a, b);
    }
    int q;
    scanf("%d", &q);
    while (q--)
    {
        int c, d;
        scanf("%d%d", &c, &d);
        if (Find(c) == Find(d)) printf("Yes\n");
        else printf("No\n");
    }
}