#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int root(vector<int> &uf, int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf, uf[u]));
}
bool connect(vector<int> &uf, int u, int v) {
  u = root(uf, u);
  v = root(uf, v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


int N, Q;
vector<int> A, B;
vector<int> L, R;

vector<vector<int>> G;

namespace brute {
vector<int> par, on;
bool dfs(int l, int r, int u, int p, int pi) {
  par[u] = p;
  for (const int i : G[u]) if (l <= i && i < r) if (pi != i) {
    const int v = A[i] ^ B[i] ^ u;
    if (par[v] != -2) {
      for (int w = u; ; w = par[w]) {
        on[w] = 1;
        if (w == v) break;
      }
      return true;
    } else {
      if (dfs(l, r, v, u, i)) return true;
    }
  }
  return false;
}
int f[5010][5010];
vector<Int> run() {
  memset(f, 0, sizeof(f));
  for (int l = 0; l < N; ++l) {
    int n = 0;
    vector<int> deg(N, 0);
    vector<int> uf(N, -1);
    int cnt = 0;
    for (int i = l; i < N; ++i) {
      if (!deg[A[i]]++) ++n;
      if (!deg[B[i]]++) ++n;
      if (!connect(uf, A[i], B[i])) {
        if (++cnt == 1) {
          par.assign(N, -2);
          on.assign(N, 0);
          const bool res = dfs(l, i + 1, A[i], -1, -1);
          assert(res);
          for (int u = 0; u < N; ++u) if (!on[u] && deg[u] >= 3) {
            goto failed;
          }
// cerr<<"l = "<<l<<", i = "<<i<<endl;
        } else {
          goto failed;
        }
      }
      if (cnt) {
        if (!on[A[i]] && deg[A[i]] >= 3) goto failed;
        if (!on[B[i]] && deg[B[i]] >= 3) goto failed;
        if (n == (i + 1) - l) {
          // [l, i+1)
// cerr<<"  ["<<l<<", "<<i+1<<")"<<endl;
          ++f[l + 1][(i + 1) + 1];
        }
      }
    }
   failed:{}
  }
  for (int l = 0; l <= N + 1; ++l) for (int r = 0; r <= N + 1; ++r) f[l + 1][r] += f[l][r];
  for (int l = 0; l <= N + 1; ++l) for (int r = 0; r <= N + 1; ++r) f[l][r + 1] += f[l][r];
  vector<Int> ans(Q, 0);
  for (int q = 0; q < Q; ++q) {
    ans[q] += f[L[q]][L[q]];
    ans[q] -= f[L[q]][R[q] + 1];
    ans[q] -= f[R[q] + 1][L[q]];
    ans[q] += f[R[q] + 1][R[q] + 1];
  }
  return ans;
}
}  // brute


int main() {
  for (; ~scanf("%d", &N); ) {
    A.resize(N);
    B.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d%d", &A[i], &B[i]);
      --A[i];
      --B[i];
    }
    scanf("%d", &Q);
    L.resize(Q);
    R.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%d%d", &L[q], &R[q]);
      --L[q];
    }
    
    G.assign(N, {});
    for (int i = 0; i < N; ++i) {
      G[A[i]].push_back(i);
      G[B[i]].push_back(i);
    }
    
    const auto ans = brute::run();
    for (int q = 0; q < Q; ++q) {
      printf("%lld\n", ans[q]);
    }
  }
  return 0;
}