#include <iostream>
using namespace std;
int n, m, s;
const int M = 5010;
int p[M];
int find(int x)
{
    if(p[x] != x) p[x] = find(p[x]);
    return p[x];
}
int main()
{
    cin >> n >> m >> s;
    for(int i = 1; i <= n; i++) p[i] = i;
    while(m--)
    {   
        int a, b;
        cin >> a >> b;
        p[find(a)] = find(b);
    }
    while(s--)
    {
       int a, b;
        cin >> a >> b;
        if(find(a) == find(b)) puts("Yes");
        else puts("No");
    }
    return 0;
}