#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
inline long long rd() {
  long long x = 0, w = 1;
  char ch = 0;
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return x * w;
}
struct graph {
  int to[N << 1], nt[N << 1], hd[N], tot;
  graph() { tot = 1; }
  inline void add(int x, int y) {
    ++tot, to[tot] = y, nt[tot] = hd[x], hd[x] = tot;
    ++tot, to[tot] = x, nt[tot] = hd[y], hd[y] = tot;
  }
} ee, tr;
int n, m, q;
bool p[N << 1];
int be[N], tot, dfn[N], low[N], ti, st[N << 1], tp, co[N];
int e[N], te, dd[N], td;
inline void tj(int x, int ffa) {
  dfn[x] = low[x] = ++ti, be[x] = tot;
  for (int i = ee.hd[x]; i; i = ee.nt[i]) {
    int y = ee.to[i];
    if (i == ffa || dfn[y] > dfn[x]) continue;
    st[++tp] = i;
    if (!dfn[y]) {
      dd[++td] = i;
      tr.add(ee.to[i], ee.to[i ^ 1]);
      co[y] = co[x] ^ 1, tj(y, i ^ 1), low[x] = min(low[x], low[y]);
      if (low[y] >= dfn[x]) {
        int z = 0;
        te = 0;
        while (z != i) e[++te] = z = st[tp--];
        bool ok = 0;
        for (int j = 1; j <= te && !ok; ++j)
          ok = co[ee.to[e[j]]] ^ co[ee.to[e[j] ^ 1]] ^ 1;
        for (int j = 1; j <= te; ++j) p[e[j]] = p[e[j] ^ 1] = ok;
      }
    } else
      low[x] = min(low[x], dfn[y]);
  }
}
int fa[N], sz[N], hson[N], top[N], de[N], a[N];
void dfs1(int x) {
  sz[x] = 1;
  for (int i = tr.hd[x]; i; i = tr.nt[i]) {
    int y = tr.to[i];
    if (y == fa[x]) continue;
    fa[y] = x, de[y] = de[x] + 1, a[y] = a[x] + p[dd[(i >> 1)]], dfs1(y),
    sz[x] += sz[y];
    hson[x] = sz[hson[x]] > sz[y] ? hson[x] : y;
  }
}
void dfs2(int x, int ntp) {
  top[x] = ntp;
  if (hson[x]) dfs2(hson[x], ntp);
  for (int i = tr.hd[x]; i; i = tr.nt[i]) {
    int y = tr.to[i];
    if (y == fa[x] || y == hson[x]) continue;
    dfs2(y, y);
  }
}
inline int glca(int x, int y) {
  while (top[x] != top[y]) {
    if (de[top[x]] < de[top[y]]) swap(x, y);
    x = fa[top[x]];
  }
  return de[x] < de[y] ? x : y;
}
int main() {
  n = rd(), m = rd();
  for (int i = 1; i <= m; ++i) ee.add(rd(), rd());
  for (int i = 1; i <= n; ++i)
    if (!dfn[i]) tp = 0, ++tot, tj(i, 0), de[i] = 1, dfs1(i), dfs2(i, i);
  q = rd();
  while (q--) {
    int x = rd(), y = rd();
    if (be[x] ^ be[y])
      puts("No");
    else {
      int lca = glca(x, y);
      (((de[x] + de[y] - (de[lca] << 1)) & 1) |
       (a[x] + a[y] - (a[lca] << 1) > 0))
          ? puts("Yes")
          : puts("No");
    }
  }
  return 0;
}
