#include <iostream>
#include <algorithm>
#include <limits>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <deque>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <chrono>
#include <random>

using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;

const ll INF = numeric_limits<ll>::max();
const ll mod = 1e9 + 7;

void unsyncIO() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
}

struct UnionFind {
    vector<int> parent;
    vector<int> size;

    UnionFind() = default;

    UnionFind(int n) : parent(n, -1), size(n, 1) {}

    int find(int u) {
        if (parent[u] == -1) return u;
        return parent[u] = find(parent[u]);
    }

    void merge(int u, int v) {
        u = find(u), v = find(v);
        if (u != v) {
            if (size[v] > size[u]) swap(u, v);
            size[u] += size[v];
            parent[v] = u;
        }
    }

    bool isRoot(int u) {
        return parent[u] == -1;
    }

    int getSize(int u) {
        return size[u];
    }
};

int n, m, q;
int ts = 0;
vector<int> low, d;
vector<vector<int>> adj;
deque<bool> visited;
UnionFind uf;

// find bridges
void dfs(int u, int p) {
    low[u] = d[u] = ts++;
    visited[u] = true;
    for (auto v: adj[u]) {
        if (v == p) continue;
        if (!visited[v]) {
            dfs(v, u);
            low[u] = min(low[u], low[v]);
            if (low[v] == d[v]) {
                // found bridge (u, v)
                uf.merge(u, v);
            }
        } else {
            low[u] = min(low[u], d[v]);
        }
    }
}

int main() {
    unsyncIO();
    cin >> n >> m >> q;
    uf = {n};
    low.resize(n);
    d.resize(n);
    adj.assign(n, vector<int>{});
    visited.assign(n, false);
    for (int i = 0; i < m; ++i) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    for (int i = 0; i < n; ++i) {
        if (!visited[i]) {
            dfs(i, -1);
        }
    }

    while (q--) {
        int x, y;
        cin >> x >> y;
        x--, y--;
        if (uf.find(x) == uf.find(y)) {
            cout << "Yes\n";
        } else {
            cout << "No\n";
        }
    }
    return 0;
}