#include<bits/stdc++.h>
using namespace std;
int n,m,p,f[66666],q,o;
int findn(int x)
{
    if(f[x]=x) return x;
    else f[x]=findn(f[x]);
    return f[x];
}
void work1(int x,int y)
{
    f[findn(x)]=findn(y);
}
void work2(int x,int y)
{
    if(findn(x)==findn(y)) cout<<"Yes";
    else cout<<"No";
}
int main()
{
    
    scanf("%d%d%d",&n,&m,&p);
    for(int i=1;i<=n;++i)
        f[i]=i;
    for(int i=1;i<=m;++i)
    {
        scanf("%d%d",&q,&o);
        work1(q,o);
    }
    for(int i=1;i<=p;++i)
    {
        scanf("%d%d",&q,&o);
        work2(q,o);
    }
    return 0;
}