#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
const int maxn = 510;
const int maxm = 1e4 + 10;
int n, m;
int vis[maxn], e[maxm][2];
struct Node {
  int fa[maxn];
  int find(int x) { return fa[x] == x ? fa[x] : (fa[x] = find(fa[x])); }
  void combine(int a, int b) {
    int faa = find(a), fab = find(b);
    if (faa != fab) fa[faa] = fab;
  }
} l[maxm], r[maxm];
int solve(Node l, Node r) {
  for (int i = 1; i <= n; i++) {
    int faa = l.find(i), fab = r.find(i);
    if (faa != fab) r.combine(faa, fab);
  }
  int ans = 0;
  for (int i = 1; i <= n; i++)
    if (r.find(i) == i) ans++;
  return ans;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) scanf("%d%d", &e[i][0], &e[i][1]);
  for (int i = 0; i < maxm; i++)
    for (int j = 0; j < maxn; j++) l[i].fa[j] = r[i].fa[j] = j;
  for (int i = 1; i <= m; i++) {
    l[i] = l[i - 1];
    r[m - i + 1] = r[m - i + 2];
    l[i].combine(e[i][0], e[i][1]);
    r[m - i + 1].combine(e[m - i + 1][0], e[m - i + 1][1]);
  }
  int k;
  scanf("%d", &k);
  for (int i = 1; i <= k; i++) {
    memset(vis, 0, sizeof(vis));
    int a, b;
    scanf("%d%d", &a, &b);
    cout << solve(l[a - 1], r[b + 1]) << endl;
  }
  return 0;
}
