#include <bits/stdc++.h>
using namespace std;
const int N = 2e4 + 5, M = 1e6 + 5;
int n, m;
int pa[N], size[N];

void init() {
    for(int i=0; i<n; i++) {
        pa[i] = i;
        size[i] = 1;
    }
}

int find(int x) {
    if(pa[x] != x) pa[x] = find(pa[x]);
    return pa[x];
}

void join(int x, int y) {
    int px = find(x), py = find(y);
    if(px == py) return;
    if(size[px] < size[py]) swap(px, py);
    pa[py] = px;
    size[px] += size[py];
}

int main(){
    scanf("%d%d", &n, &m);
    init();
    while(m--) {
        int a, b;
        scanf("%d%d", &a, &b);
        join(a, b);
    }
    int q;
    scanf("%d", &q);
    while(q--) {
        int c, d;
        scanf("%d%d", &c, &d);
        if(find(c) == find(d)) printf("Yes\n");
        else printf("No\n");
    }
    return 0;