#include<bits/stdc++.h>
using namespace std;
int n,m,k,a[5005],x,y;
int find(int s)
{
    if(a[s]!=s)
        return find(a[s]);
}
void hb(int x,int y)
{
	a[find(y)]=find(x);
}
int main()
{
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++)
        a[i]=i;
    while(m--)
    {
        cin>>x>>y;
        hb(x,y);
    }
    while(k--)
    {
        cin>>x>>y;
        if(find(x)==find(y))
            cout<<"Yes";
        else
            cout<<"No";
        cout<<endl;
    }
}