//
// Created by JimmyChen on 6/10/17.
//
#include <cstdio>
#include <iostream>
#include <string>

using namespace std;

const int maxN = 9999999;

struct UnionFind_set{
    int N;
    int p[maxN];
    inline void init(int n){N = n; for(int i = 0 ; i <= N; ++i) p[i] = i;}
    inline int root(int i){for(;i != p[i]; i = p[i]) p[i] = p[p[i]]; return i;}
    inline void unite(int a, int b){p[root(b)] = root(a);}
    inline bool query(int a, int b){return root(a) == root(b);}
}relatives;

int main(){
    int n = 0, m = 0, p = 0;
    cin >> n >> m >> p;
    relatives.init(n);
    int a, b;
    for (int i = 0; i < m; i++){
        cin >> a >> b;
        relatives.unite(a, b);
    }
    for (int i = 0; i < p; i++){
        cin >> a >> b;
        if(relatives.query(a, b)) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
    return 0;
}

import java.io.BufferedInputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
public class Main{
    static int n,m,p;
    static List<List<Integer>>list;
    static boolean vis[];
    static int belong[],blocks;
    public static void DFS(int now){
        for(int i=0;i<list.get(now).size();++i)
            if(!vis[list.get(now).get(i)]){
                vis[list.get(now).get(i)]=true;
                DFS(list.get(now).get(i));
                belong[list.get(now).get(i)]=blocks;
            }
    }
    public static void main(String[] args) {
        Scanner in=new Scanner(new BufferedInputStream(System.in));
        int a,b;
        n=in.nextInt();
        m=in.nextInt();
        p=in.nextInt();
        list=new ArrayList<List<Integer>>();
        for(int i=0;i<=n;++i)
            list.add(new ArrayList<Integer>());
        while(m--!=0){
            a=in.nextInt();
            b=in.nextInt();
            list.get(a).add(b);
            list.get(b).add(a);
        }
        vis=new boolean[n+1];
        belong=new int[n+1];
        blocks=0;
        Arrays.fill(vis,false);
        Arrays.fill(belong,-1);
        for(int i=1;i<=n;++i)
            if(!vis[i]){
                belong[i]=blocks;
                DFS(i);
                blocks++;
            }
        while(p--!=0){
            a=in.nextInt();
            b=in.nextInt();
            if(belong[a]==belong[b])    System.out.println("Yes");
            else    System.out.println("No");           
        }
        in.close();
    }
}

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int fa[10001];
int n,m,p;
inline int get(int x)
{
    return fa[x]==x?x:fa[x]=get(fa[x]);
}
int main()
{
    scanf("%d%d%d",&n,&m,&p);
    for(int i=1;i<=n;i++)   fa[i]=i;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        fa[get(x)]=get(y);
    }
    for(int i=1;i<=p;i++)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        if(get(x)==get(y))  
            printf("Yes\n");else printf("No\n");
    }
}