12 12
5 1
5 11
1 11
8 11
8 9
5 12
6 9
7 11
9 3
9 10
4 12
10 2
78
1 1
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
1 11
1 12
2 2
2 3
2 4
2 5
2 6
2 7
2 8
2 9
2 10
2 11
2 12
3 3
3 4
3 5
3 6
3 7
3 8
3 9
3 10
3 11
3 12
4 4
4 5
4 6
4 7
4 8
4 9
4 10
4 11
4 12
5 5
5 6
5 7
5 8
5 9
5 10
5 11
5 12
6 6
6 7
6 8
6 9
6 10
6 11
6 12
7 7
7 8
7 9
7 10
7 11
7 12
8 8
8 9
8 10
8 11
8 12
9 9
9 10
9 11
9 12
10 10
10 11
10 12
11 11
11 12
12 12

1
3
6
10
15
21
28
36
45
55
65
76
1
3
6
10
15
21
28
36
45
55
66
1
3
6
10
15
21
28
36
45
55
1
3
6
10
15
21
28
36
45
1
3
6
10
15
21
28
36
1
3
6
10
15
21
28
1
3
6
10
15
21
1
3
6
10
15
1
3
6
10
1
3
6
1
3
1

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-10;
const int M = 1e9 + 7;
int dcmp(double first) {
  if (fabs(first) < eps) return 0;
  return first < 0 ? -1 : 1;
}
struct Edge {
  int u, v;
};
const int maxn = 5e5 + 10;
int pre[maxn], iscut[maxn], bccno[maxn], dfs_clock, bcc_cnt;
vector<int> G[maxn], bcc[maxn];
stack<Edge> S;
int dfs(int u, int fa) {
  int lowu = pre[u] = ++dfs_clock;
  int child = 0;
  for (int i = 0; i < G[u].size(); i++) {
    int v = G[u][i];
    Edge e = (Edge){u, v};
    if (!pre[v]) {
      S.push(e);
      child++;
      int lowv = dfs(v, u);
      lowu = min(lowu, lowv);
      if (lowv >= pre[u]) {
        iscut[u] = true;
        bcc_cnt++;
        bcc[bcc_cnt].clear();
        for (;;) {
          Edge first = S.top();
          S.pop();
          if (bccno[first.u] != bcc_cnt) {
            bcc[bcc_cnt].push_back(first.u);
            bccno[first.u] = bcc_cnt;
          }
          if (bccno[first.v] != bcc_cnt) {
            bcc[bcc_cnt].push_back(first.v);
            bccno[first.v] = bcc_cnt;
          }
          if (first.u == u && first.v == v) break;
        }
      }
    } else if (pre[v] < pre[u] && v != fa) {
      S.push(e);
      lowu = min(lowu, pre[v]);
    }
  }
  if (fa < 0 && child == 1) iscut[u] = 0;
  return lowu;
}
void find_bcc(int n) {
  memset(pre, 0, sizeof(pre));
  memset(iscut, 0, sizeof(iscut));
  memset(bccno, 0, sizeof(bccno));
  dfs_clock = bcc_cnt = 0;
  for (int i = 0; i < n; i++)
    if (!pre[i]) dfs(i, -1);
}
vector<pair<int, int> > a;
long long sum[N][5];
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    u--;
    v--;
    G[u].push_back(v);
    G[v].push_back(u);
  }
  find_bcc(n);
  for (int i = 1; bcc[i].size(); i++) {
    if (bcc[i].size() <= 2) continue;
    sort(bcc[i].begin(), bcc[i].end());
    a.push_back(make_pair(bcc[i].front(), bcc[i].back()));
  }
  sort(a.begin(), a.end());
  for (int i = 0; i < a.size(); i++) {
    sum[i + 1][0] = sum[i][0] + a[i].first;
    sum[i + 1][1] = sum[i][1] + a[i].second;
    sum[i + 1][2] = sum[i][2] + (long long)a[i].first * a[i].second;
  }
  int Q;
  scanf("%d", &Q);
  while (Q--) {
    int first, second;
    scanf("%d %d", &first, &second);
    first--;
    second--;
    int l =
        lower_bound(a.begin(), a.end(), make_pair(first, first)) - a.begin();
    int r = lower_bound(a.begin(), a.end(), make_pair(second, second)) -
            a.begin() - 1;
    long long ans = (long long)(second - first + 1) * (second - first + 2) / 2;
    if (r < l || l > a.size()) {
      printf("%lld\n", ans);
      continue;
    }
    long long L = sum[r + 1][0] - sum[l][0], R = sum[r + 1][1] - sum[l][1];
    ans -= L * (second + 1) + (first - 1) * R - (sum[r + 1][2] - sum[l][2]) -
           (long long)(r - l + 1) * (first - 1) * (second + 1);
    printf("%lld\n",
           ans + (a[l].first == first && a[r].second == second && r > l));
  }
  return 0;
}
