#include <bits/stdc++.h>
using namespace std;
const int MAXN = 10005;
int fp[MAXN][501];
int bp[MAXN][501];
int parent[505];
pair<int, int> e[MAXN];
int find(int type, int pos, int u) {
  if (type == 0) {
    return (fp[pos][u] == u) ? u : fp[pos][u] = find(type, pos, fp[pos][u]);
  } else {
    return (bp[pos][u] == u) ? u : bp[pos][u] = find(type, pos, bp[pos][u]);
  }
}
void mrg(int type, int pos, int u, int v) {
  u = find(type, pos, u);
  v = find(type, pos, v);
  if (u == v) return;
  if (type == 0) {
    fp[pos][u] = v;
  } else {
    bp[pos][u] = v;
  }
}
int find(int u) { return u == parent[u] ? u : parent[u] = find(parent[u]); }
void mg(int u, int v) {
  u = find(u);
  v = find(v);
  if (u == v) return;
  parent[u] = v;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= m; i++) cin >> e[i].first >> e[i].second;
  for (int i = 0; i < MAXN; i++)
    for (int j = 0; j < 501; j++) fp[i][j] = j, bp[i][j] = j;
  for (int i = 1; i <= m; i++) {
    for (int j = 1; j <= n; j++) fp[i][j] = fp[i - 1][j];
    mrg(0, i, e[i].first, e[i].second);
  }
  for (int i = m; i >= 1; i--) {
    for (int j = 1; j <= n; j++) bp[i][j] = bp[i + 1][j];
    mrg(1, i, e[i].first, e[i].second);
  }
  int q;
  cin >> q;
  for (int i = 1; i <= q; i++) {
    for (int j = 1; j <= n; j++) parent[j] = j;
    int l, r;
    cin >> l >> r;
    l--;
    r++;
    for (int j = 1; j <= n; j++) {
      int p = find(0, l, j);
      mg(p, j);
    }
    for (int j = 1; j <= n; j++) {
      int p = find(1, r, j);
      mg(p, j);
    }
    int cnt = 0;
    for (int j = 1; j <= n; j++) {
      if (j == find(j)) cnt++;
    }
    cout << cnt << "\n";
  }
  return 0;
}
