親戚

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <cctype>
#include <ctime>
#include <queue>
using namespace std;

int n,m,i,j;
int father[20001];

int get_int()
{
   int x=0;
   char ch;
   for(ch=getchar();ch<'0'||ch>'9';ch=getchar());
   for(;ch>='0'&&ch<='9';ch=getchar())
     x=(x<<3)+(x<<1)+ch-'0';
   return x;
}

int getfather(int v)
{
   if(father[v]==v) return v;
   father[v]=getfather(father[v]);
   return father[v];
}

void merge(int x,int y)
{
   int i,j;
   i=getfather(x);
   j=getfather(y);
   if(father[i]!=father[j]) father[i]=j;
}

int main()
{
   freopen("lx.in","r",stdin);
   freopen("lx.out","w",stdout);
   int x,y;
   memset(father,0,sizeof(father));

   n=get_int();
   m=get_int();

   for(int i=1;i<=n;i++) father[i]=i;
   for(int i=1;i<=m;i++)
   {
   	 x=get_int();
   	 y=get_int();
   	 merge(x,y);
   }

   int q;
   q=get_int();
   for(int i=1;i<=q;i++)
   {
   	 x=get_int();
   	 y=get_int();
   	 if(getfather(x)==getfather(y)) cout<<"Yes"<<endl;
   	 else cout<<"No"<<endl;
   }

   return 0;
}