#include <cstdio>
#include <vector>
#include <algorithm>
#include <tr1/unordered_map>
using namespace std;
const int N = 1e5;
const int mod = 1e9 + 7;
inline int fpow(int a, int b) {
  int ret = 1;
  for (; b; b >>= 1)
    (b & 1) && (ret = (long long)ret * a % mod), a = (long long)a * a % mod;
  return ret;
}
int W, n, m;
int fac[N + 5], ifac[N + 5];
int cnt, sum = 1, ans1, ans2;
vector<int> e[N + 5];
inline int C(int n, int m) {
  return n < m ? 0 : (long long)fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}
inline int Ci(int n, int m) {
  return n < m ? 0 : (long long)ifac[n] * fac[m] % mod * fac[n - m] % mod;
}
tr1::unordered_map< int, tr1::unordered_map<int, int>> id;
int fa[N + 5], ls[N + 5], rs[N + 5], sz[N + 5], rt;
void build(int &p, int l, int r) {
  static int tot = 0;
  if (r - l == 1)
    return ;
  id[l][r] = p = ++tot;
  int mid = *upper_bound(e[r].begin(), e[r].end(), l);
  build(ls[p], l, mid), build(rs[p], mid, r),
        ls[p] &&(fa[ls[p]] = p),
        rs[p] && (fa[rs[p]] = p),
        sz[p] = sz[ls[p]] + 1 + sz[rs[p]],
                sum = (long long)sum * C(sz[p] - 1, sz[ls[p]]) % mod;
}
int main() {
  scanf("%d%d", &W, &n), fac[0] = 1;
  for (register int i = 1; i <= n; ++i)
    fac[i] = (long long)fac[i - 1] * i % mod;
  ifac[n] = fpow(fac[n], mod - 2);
  for (register int i = n; i; --i)
    ifac[i - 1] = (long long)ifac[i] * i % mod;
  int u, v;
  for (register int i = 1; i <= n - 3; ++i)
    scanf("%d%d", &u, &v), e[u].push_back(v), e[v].push_back(u);
  for (register int i = 1; i <= n; ++i)
    e[i].push_back(i % n + 1), e[i % n + 1].push_back(i);
  for (register int i = 1; i <= n; ++i)
    sort(e[i].begin(), e[i].end());
  for (register vector<int>::iterator i = e[n].begin(), j = i + 1; j != e[n].end(); ++i, ++j)
    rt = 0, build(rt, *i, *j), sum = (long long)sum * C(cnt += sz[rt], sz[rt]) % mod;
  printf("%d%c", cnt, "\n "[W]), W &&printf("%d\n", sum);
  for (scanf("%d", &m); m; --m) {
    scanf("%d%d", &u, &v), ans1 = cnt, ans2 = sum;
    int p = id[u][v];
    if (fa[p])
      ans2 = (long long)ans2 * Ci(sz[p] - 1, sz[ls[p]]) % mod * Ci(sz[fa[p]] - 1, sz[p]) % mod,
      ans2 = (long long)ans2 * C(sz[rs[p]] + sz[rs[fa[p]]], sz[rs[p]]) % mod * C(sz[p] + sz[rs[fa[p]]],
             sz[ls[p]]) % mod;
    else
      --ans1,
      ans2 = (long long)ans2 * Ci(sz[p] - 1, sz[ls[p]]) % mod * Ci(cnt, sz[p]) % mod,
      ans2 = (long long)ans2 * C(cnt - sz[rs[p]] - 1, sz[ls[p]]) % mod * C(cnt - 1, sz[rs[p]]) % mod;
    printf("%d%c", ans1, "\n "[W]), W &&printf("%d\n", ans2);
  }
}