#include <iostream>
using namespace std;

int n, m, p;
int root[5001];

int Find(int x)
{
    if(root[x] != x)
        root[x] = Find(root[x]);
    return root[x];
}
void Union(int x, int y)
{
    int xRoot = root[x];
    int yRoot = root[y];
    if(xRoot != yRoot){
        root[xRoot] = yRoot;
    }
    return;
}

int main()
{
    cin >> n >> m >> p;
    for(int i = 1; i <= n; i++)
        root[i] = i;
    int tx, ty;
    for(int i = 1; i <= m; i++) {
        cin >> tx >> ty;
        Union(tx, ty);
    }
    for(int i = 1; i <= p; i++) {
        cin >> tx >> ty;
        if (Find(tx) == Find(ty))
            cout << "Yes\n";
        else
            cout << "No\n";
    }
    return 0;
}