#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; }

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1000000007;
using Mint = ModInt<MO>;


// T: monoid representing information of an interval.
//   T()  should return the identity.
//   T(S s)  should represent a single element of the array.
//   T::push(T &l, T &r)  should push the lazy update.
//   T::pull(const T &l, const T &r)  should pull two intervals.
template <class T> struct SegmentTreeRange {
  int logN, n;
  vector<T> ts;
  SegmentTreeRange() : logN(0), n(0) {}
  explicit SegmentTreeRange(int n_) {
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
  }
  template <class S> explicit SegmentTreeRange(const vector<S> &ss) {
    const int n_ = ss.size();
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
    for (int i = 0; i < n_; ++i) at(i) = T(ss[i]);
    build();
  }
  T &at(int i) {
    return ts[n + i];
  }
  void build() {
    for (int u = n; --u; ) pull(u);
  }

  inline void push(int u) {
    ts[u].push(ts[u << 1], ts[u << 1 | 1]);
  }
  inline void pull(int u) {
    ts[u].pull(ts[u << 1], ts[u << 1 | 1]);
  }

  // Applies T::f(args...) to [a, b).
  template <class F, class... Args>
  void ch(int a, int b, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return;
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) (ts[aa++].*f)(args...);
      if (bb & 1) (ts[--bb].*f)(args...);
    }
    for (int h = 1; h <= logN; ++h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) pull(aa);
      } else {
        if ((aa << h) != a) pull(aa);
        if ((bb << h) != b) pull(bb);
      }
    }
  }

  // Calculates the product for [a, b).
  T get(int a, int b) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return T();
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    T prodL, prodR, t;
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) { t.pull(prodL, ts[aa++]); prodL = t; }
      if (bb & 1) { t.pull(ts[--bb], prodR); prodR = t; }
    }
    t.pull(prodL, prodR);
    return t;
  }

  // Calculates T::f(args...) of a monoid type for [a, b).
  //   op(-, -)  should calculate the product.
  //   e()  should return the identity.
  template <class Op, class E, class F, class... Args>
#if __cplusplus >= 201402L
  auto
#else
  decltype((std::declval<T>().*F())())
#endif
  get(int a, int b, Op op, E e, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return e();
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    auto prodL = e(), prodR = e();
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) prodL = op(prodL, (ts[aa++].*f)(args...));
      if (bb & 1) prodR = op((ts[--bb].*f)(args...), prodR);
    }
    return op(prodL, prodR);
  }

  // Find min b s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from left to right.
  //   Returns n + 1 if there is no such b.
  template <class F, class... Args>
  int findRight(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a <= n);
    if ((T().*f)(args...)) return a;
    if (a == n) return n + 1;
    a += n;
    for (int h = logN; h; --h) push(a >> h);
    for (; ; a >>= 1) if (a & 1) {
      if ((ts[a].*f)(args...)) {
        for (; a < n; ) {
          push(a);
          if (!(ts[a <<= 1].*f)(args...)) ++a;
        }
        return a - n + 1;
      }
      ++a;
      if (!(a & (a - 1))) return n + 1;
    }
  }

  // Find max a s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from right to left.
  //   Returns -1 if there is no such a.
  template <class F, class... Args>
  int findLeft(int b, F f, Args &&... args) {
    assert(0 <= b); assert(b <= n);
    if ((T().*f)(args...)) return b;
    if (b == 0) return -1;
    b += n;
    for (int h = logN; h; --h) push((b - 1) >> h);
    for (; ; b >>= 1) if ((b & 1) || b == 2) {
      if ((ts[b - 1].*f)(args...)) {
        for (; b <= n; ) {
          push(b - 1);
          if (!(ts[(b <<= 1) - 1].*f)(args...)) --b;
        }
        return b - n - 1;
      }
      --b;
      if (!(b & (b - 1))) return -1;
    }
  }
};

////////////////////////////////////////////////////////////////////////////////


struct HLD {
  int n, rt;
  // needs to be tree
  // vertex lists
  // modified in build(rt) (parent removed, heavy child first)
  vector<vector<int>> graph;
  vector<int> sz, par, dep;
  int zeit;
  vector<int> dis, fin, sid;
  // head vertex (minimum depth) in heavy path
  vector<int> head;

  HLD() : n(0), rt(-1), zeit(0) {}
  explicit HLD(int n_) : n(n_), rt(-1), graph(n), zeit(0) {}
  void ae(int u, int v) {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    graph[u].push_back(v);
    graph[v].push_back(u);
  }

  void dfsSz(int u) {
    sz[u] = 1;
    for (const int v : graph[u]) {
      auto it = std::find(graph[v].begin(), graph[v].end(), u);
      if (it != graph[v].end()) graph[v].erase(it);
      par[v] = u;
      dep[v] = dep[u] + 1;
      dfsSz(v);
      sz[u] += sz[v];
    }
  }
  void dfsHLD(int u) {
    dis[u] = zeit++;
    const int deg = graph[u].size();
    if (deg > 0) {
      int vm = graph[u][0];
      int jm = 0;
      for (int j = 1; j < deg; ++j) {
        const int v = graph[u][j];
        if (sz[vm] < sz[v]) {
          vm = v;
          jm = j;
        }
      }
      swap(graph[u][0], graph[u][jm]);
      head[vm] = head[u];
      dfsHLD(vm);
      for (int j = 1; j < deg; ++j) {
        const int v = graph[u][j];
        head[v] = v;
        dfsHLD(v);
      }
    }
    fin[u] = zeit;
  }
  void build(int rt_) {
    assert(0 <= rt_); assert(rt_ < n);
    rt = rt_;
    sz.assign(n, 0);
    par.assign(n, -1);
    dep.assign(n, -1);
    dep[rt] = 0;
    dfsSz(rt);
    zeit = 0;
    dis.assign(n, -1);
    fin.assign(n, -1);
    head.assign(n, -1);
    head[rt] = rt;
    dfsHLD(rt);
    assert(zeit == n);
    sid.assign(n, -1);
    for (int u = 0; u < n; ++u) sid[dis[u]] = u;
  }

  friend ostream &operator<<(ostream &os, const HLD &hld) {
    const int maxDep = *max_element(hld.dep.begin(), hld.dep.end());
    vector<string> ss(2 * maxDep + 1);
    int pos = 0, maxPos = 0;
    for (int j = 0; j < hld.n; ++j) {
      const int u = hld.sid[j];
      const int d = hld.dep[u];
      if (hld.head[u] == u) {
        if (j != 0) {
          pos = maxPos + 1;
          ss[2 * d - 1].resize(pos, '-');
          ss[2 * d - 1] += '+';
        }
      } else {
        ss[2 * d - 1].resize(pos, ' ');
        ss[2 * d - 1] += '|';
      }
      ss[2 * d].resize(pos, ' ');
      ss[2 * d] += std::to_string(u);
      if (maxPos < static_cast<int>(ss[2 * d].size())) {
        maxPos = ss[2 * d].size();
      }
    }
    for (int d = 0; d <= 2 * maxDep; ++d) os << ss[d] << '\n';
    return os;
  }

  bool contains(int u, int v) const {
    return (dis[u] <= dis[v] && dis[v] < fin[u]);
  }
  int lca(int u, int v) const {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    for (; head[u] != head[v]; ) (dis[u] > dis[v]) ? (u = par[head[u]]) : (v = par[head[v]]);
    return (dis[u] > dis[v]) ? v : u;
  }
  int jumpUp(int u, int d) const {
    assert(0 <= u); assert(u < n);
    assert(d >= 0);
    if (dep[u] < d) return -1;
    const int tar = dep[u] - d;
    for (u = head[u]; ; u = head[par[u]]) {
      if (dep[u] <= tar) return sid[dis[u] + (tar - dep[u])];
    }
  }
  int jump(int u, int v, int d) const {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    assert(d >= 0);
    const int l = lca(u, v);
    const int du = dep[u] - dep[l], dv = dep[v] - dep[l];
    if (d <= du) {
      return jumpUp(u, d);
    } else if (d <= du + dv) {
      return jumpUp(v, du + dv - d);
    } else {
      return -1;
    }
  }
  // [u, v) or [u, v]
  template <class F> void doPathUp(int u, int v, bool inclusive, F f) const {
    assert(contains(v, u));
    for (; head[u] != head[v]; u = par[head[u]]) f(dis[head[u]], dis[u] + 1);
    if (inclusive) {
      f(dis[v], dis[u] + 1);
    } else {
      if (v != u) f(dis[v] + 1, dis[u] + 1);
    }
  }
  // not path order, include lca(u, v) or not
  template <class F> void doPath(int u, int v, bool inclusive, F f) const {
    const int l = lca(u, v);
    doPathUp(u, l, false, f);
    doPathUp(v, l, inclusive, f);
  }

  // (vs, ps): compressed tree
  // vs: DFS order (sorted by dis)
  // vs[ps[x]]: the parent of vs[x]
  // ids[vs[x]] = x, not set for non-tree vertex
  vector<int> ids;
  pair<vector<int>, vector<int>> compress(vector<int> us) {
    // O(n) first time
    ids.resize(n, -1);
    std::sort(us.begin(), us.end(), [&](int u, int v) -> bool {
      return (dis[u] < dis[v]);
    });
    us.erase(std::unique(us.begin(), us.end()), us.end());
    int usLen = us.size();
    assert(usLen >= 1);
    for (int x = 1; x < usLen; ++x) us.push_back(lca(us[x - 1], us[x]));
    std::sort(us.begin(), us.end(), [&](int u, int v) -> bool {
      return (dis[u] < dis[v]);
    });
    us.erase(std::unique(us.begin(), us.end()), us.end());
    usLen = us.size();
    for (int x = 0; x < usLen; ++x) ids[us[x]] = x;
    vector<int> ps(usLen, -1);
    for (int x = 1; x < usLen; ++x) ps[x] = ids[lca(us[x - 1], us[x])];
    return make_pair(us, ps);
  }
};

////////////////////////////////////////////////////////////////////////////////


struct Node {
  Mint sum, lz;
  Node() : sum(0), lz(1) {}
  void push(Node &l, Node &r) {
    if (lz != 1) {
      l.mul(lz);
      r.mul(lz);
      lz = 1;
    }
  }
  void pull(const Node &l, const Node &r) {
    sum = l.sum + r.sum;
  }
  void mul(const Mint &val) {
    sum *= val;
    lz *= val;
  }
  // leaf
  void add(const Mint &val) {
    sum += val;
  }
};


int Subtask;
int N, M, K;
vector<int> A, B, C, D;
vector<int> S;

const Mint INV2 = Mint(2).inv();
vector<Mint> two, owt;

HLD hld;


namespace brute {
int d[310][310];
bool check(int m, int u) {
  return (
    d[C[m]][u] == d[C[m]][D[m]] + d[D[m]][u] ||
    d[D[m]][u] == d[D[m]][C[m]] + d[C[m]][u]
  );
}
Mint run() {
  for (int u = 0; u < N; ++u) {
    fill(d[u], d[u] + N, N);
    d[u][u] = 0;
  }
  for (int i = 0; i < N - 1; ++i) {
    chmin(d[A[i]][B[i]], 1);
    chmin(d[B[i]][A[i]], 1);
  }
  for (int w = 0; w < N; ++w) for (int u = 0; u < N; ++u) for (int v = 0; v < N; ++v) {
    chmin(d[u][v], d[u][w] + d[w][v]);
  }
  Mint ans = 0;
  for (int p = 1; p < 1 << K; ++p) {
    int cnt = 0;
    for (int m = 0; m < M; ++m) {
      bool ok = true;
      for (int k = 0; k < K; ++k) if (p >> k & 1) {
        ok = ok && check(m, S[k]);
      }
      if (ok) {
        ++cnt;
      }
    }
// cerr<<"[brute] p = "<<p<<": cnt = "<<cnt<<endl;
    ans -= (__builtin_parity(p)?-1:+1) * two[cnt];
  }
  return ans;
}
}  // brute


Mint run() {
  const auto &dis = hld.dis;
  const auto &fin = hld.fin;
  vector<vector<int>> dss(N);
  vector<vector<pair<int, int>>> cdss(N);
  for (int m = 0; m < M; ++m) {
    int c = C[m], d = D[m];
    if (dis[c] > dis[d]) swap(c, d);
    if (hld.contains(c, d)) {
      dss[c].push_back(d);
    } else {
      const int l = hld.lca(c, d);
      cdss[l].emplace_back(c, d);
    }
  }
  vector<int> inS(N, 0);
  for (int k = 0; k < K; ++k) {
    inS[S[k]] = 1;
  }
  /*
    seg: more PIE vertex
    cross: no more PIE vertex (*2 by tree-edge or cross-edge (1 subtree))
  */
  SegmentTreeRange<Node> seg(N), cross(N);
  vector<int> below(N, 0);
  for (int j = N; --j >= 0; ) {
    const int u = hld.sid[j];
    
    // tree-edge
    for (const int d : dss[u]) {
      seg.ch(dis[d], fin[d], &Node::mul, 2);
      cross.ch(dis[d], fin[d], &Node::mul, 2);
      const int v = hld.jump(u, d, 1);
      ++below[v];
    }
    // to merge *2's
    for (const int v : hld.graph[u]) {
      below[u] += below[v];
      seg.ch(dis[v], fin[v], &Node::mul, owt[below[v]]);
      cross.ch(dis[v], fin[v], &Node::mul, owt[below[v]]);
    }
    
    // cross-edge, 1 subtree
    for (const auto &cd : cdss[u]) {
      for (const int v : {cd.first, cd.second}) {
        cross.ch(dis[v], fin[v], &Node::mul, 2);
      }
    }
    
    // cross-edge, 2 subtrees: *2 for [dis[c], fin[c]) * [dis[d], fin[d])
    {
      vector<int> xs;
      for (const int v : hld.graph[u]) {
        xs.push_back(dis[v]);
      }
      xs.push_back(fin[u]);
      for (const auto &cd : cdss[u]) {
        xs.push_back(dis[cd.first]);
        xs.push_back(fin[cd.first]);
      }
      sort(xs.begin(), xs.end());
      xs.erase(unique(xs.begin(), xs.end()), xs.end());
      const int len = (int)xs.size() - 1;
      vector<vector<pair<int, Mint>>> eventss(len + 1);
      auto add = [&](int x, int d, Mint val) -> void {
        eventss[lower_bound(xs.begin(), xs.end(), x) - xs.begin()].emplace_back(d, val);
      };
      for (const auto &cd : cdss[u]) {
        add(dis[cd.first], cd.second, 2);
        add(fin[cd.first], cd.second, INV2);
      }
      Mint here2 = 0;
      {
        int k = 0;
        for (const int v : hld.graph[u]) {
          for (; xs[k] < fin[v]; ++k) {
            for (const auto &event : eventss[k]) {
              seg.ch(dis[event.first], fin[event.first], &Node::mul, event.second);
            }
            const Mint resL = seg.get(xs[k], xs[k + 1]).sum;
            const Mint resR = seg.get(fin[v], fin[u]).sum;
            here2 += resL * resR;
          }
        }
        for (; k <= len; ++k) {
          for (const auto &event : eventss[k]) {
            seg.ch(dis[event.first], fin[event.first], &Node::mul, event.second);
          }
        }
      }
// cerr<<"cdss["<<u<<"] = "<<cdss[u]<<": 2^below[u] * here2 = 2^"<<below[u]<<" * "<<here2<<" = "<<(two[below[u]]*here2)<<endl;
      cross.ch(dis[u], dis[u] + 1, &Node::add, here2);
    }
    
    // state u (without choosing PIE vertex): take (>= 2) subtrees
    {
      Mint dp[4] = {};
      dp[0] = 1;
      for (const int v : hld.graph[u]) {
        const Mint res = seg.get(dis[v], fin[v]).sum;
        for (int k = 3; k >= 0; --k) {
          dp[min(k + 1, 3)] += dp[k] * res;
        }
      }
// cerr<<"u = "<<u<<": 2^below[u] * dp[2] = 2^"<<below[u]<<" * "<<dp[2]<<" = "<<(two[below[u]]*dp[2])<<endl;
// cerr<<"u = "<<u<<": 2^below[u] * dp[3] = 2^"<<below[u]<<" * "<<dp[3]<<" = "<<(two[below[u]]*dp[2])<<endl;
      seg.ch(dis[u], dis[u] + 1, &Node::add, dp[2] + dp[3]);
      cross.ch(dis[u], dis[u] + 1, &Node::add, dp[3]);
    }
    
    // to merge *2's
    seg.ch(dis[u], fin[u], &Node::mul, two[below[u]]);
    cross.ch(dis[u], fin[u], &Node::mul, two[below[u]]);
    
    // PIE vertex
    if (inS[u]) {
      Mint here = 0;
      here -= two[below[u]];
      here -= seg.get(dis[u], fin[u]).sum;
// cerr<<"u = "<<u<<": here = "<<here<<endl;
      seg.ch(dis[u], dis[u] + 1, &Node::add, here);
      cross.ch(dis[u], dis[u] + 1, &Node::add, here);
    }
  }
  Mint ans = 0;
  ans -= cross.get(0, N).sum;
  return ans;
}


int main() {
  for (; ~scanf("%d", &Subtask); ) {
    scanf("%d%d%d", &N, &M, &K);
    A.resize(N - 1);
    B.resize(N - 1);
    for (int i = 0; i < N - 1; ++i) {
      scanf("%d%d", &A[i], &B[i]);
      --A[i];
      --B[i];
    }
    C.resize(M);
    D.resize(M);
    for (int m = 0; m < M; ++m) {
      scanf("%d%d", &C[m], &D[m]);
      --C[m];
      --D[m];
    }
    S.resize(K);
    for (int k = 0; k < K; ++k) {
      scanf("%d", &S[k]);
      --S[k];
    }
    sort(S.begin(), S.end());
    
    two.resize(M + 1);
    owt.resize(M + 1);
    two[0] = 1;
    owt[0] = 1;
    for (int m = 1; m <= M; ++m) {
      two[m] = two[m - 1] * 2;
      owt[m] = owt[m - 1] * INV2;
    }
    
    hld = HLD(N);
    for (int i = 0; i < N - 1; ++i) {
      hld.ae(A[i], B[i]);
    }
    hld.build(0);
// cerr<<"========"<<endl<<hld<<endl;
    
    const Mint ans = run();
    printf("%u\n", ans.x);
#ifdef LOCAL
if(K<=20){
 const Mint brt=brute::run();
 if(brt!=ans)cerr<<A<<" "<<B<<" "<<C<<" "<<D<<" "<<S<<": "<<brt<<" "<<ans<<endl;
 assert(brt==ans);
}
#endif
  }
  return 0;
}