#include <bits/stdc++.h>
using namespace std;
int a[5001],n,m,p;
void chushihua(int x){
    for(int i=1;i<=x;i++){
        a[i]=i;
    }
}
int find(int zi){
    if(a[zi]!=zi){
        a[zi]=find(a[zi]);
    }
    return a[zi];
}
int hebing(int x,int y){
    int xf=find(x),yf=find(y);
    if(yf!=xf) a[yf]=xf;
}
int main() {
    cin>>n>>m>>p;
    chushihua(n);
    for(int i=1;i<=m;i++){
        int x,y;
        cin>>x>>y;
        hebing(x,y);
    }
    for(int i=1;i<=p;i++){
        int x,y;
        cin>>x>>y;
        if(find(x)==find(y)){
            cout<<"Yes"<<endl;
        }else{
            cout<<"No"<<endl;
        }
    }
 return 0;
}