#include <bits/stdc++.h>

using i64 = long long;

template<class T>
T qmi(T a, i64 b) {
  T res = 1;
  for (; b; b /= 2, a *= a) {
    if (b % 2) {
      res *= a;
    }
  }
  return res;
}

i64 mul(i64 a, i64 b, i64 p) {
  i64 res = a * b - i64(1.L * a * b / p) * p;
  res %= p;
  if (res < 0) {
    res += p;
  }
  return res;
}

template<int P>
struct modint {
  int x;
  constexpr modint() : x{} {}
  constexpr modint(i64 x) : x{norm(x % getmod())} {}

  static int mod;
  constexpr static int getmod() {
    if (P > 0) {
      return P;
    } else {
      return mod;
    }
  }
  constexpr static void setmod(int m) {
    mod = m;
  }
  constexpr int norm(int x) const {
    if (x < 0) {
      x += getmod();
    }
    if (x >= getmod()) {
      x -= getmod();
    }
    return x;
  }
  constexpr int val() const {
    return x;
  }
  explicit constexpr operator int() const {
    return x;
  }
  constexpr modint operator-() const {
    modint res;
    res.x = norm(getmod() - x);
    return res;
  }
  constexpr modint inv() const {
    assert(x != 0);
    return qmi(*this, getmod() - 2);
  }
  constexpr modint &operator*= (modint v) & {
    x = 1LL * x * v.x % getmod();
    return *this;
  }
  constexpr modint &operator+= (modint v) & {
    x = norm(x + v.x);
    return *this;
  }
  constexpr modint &operator-= (modint v) & {
    x = norm(x - v.x);
    return *this;
  }
  constexpr modint &operator/= (modint v) & {
    return *this *= v.inv();
  }
  friend constexpr modint operator- (modint a, modint b) {
    modint res = a;
    res -= b;
    return res;
  }
  friend constexpr modint operator+ (modint a, modint b) {
    modint res = a;
    res += b;
    return res;
  }
  friend constexpr modint operator* (modint a, modint b) {
    modint res = a;
    res *= b;
    return res;
  }
  friend constexpr modint operator/ (modint a, modint b) {
    modint res = a;
    res /= b;
    return res;
  }
  friend constexpr std::istream &operator>> (std::istream& is, modint& a) {
    i64 v;
    is >> v;
    a = modint(v);
    return is;
  }
  friend constexpr std::ostream &operator<< (std::ostream& os, const modint& a) {
    return os << a.val();
  }
  friend constexpr bool operator== (modint a, modint b) {
    return a.val() == b.val();
  }
  friend constexpr bool operator!= (modint a, modint b) {
    return a.val() != b.val();
  }
};

constexpr int P = 1E9 + 7;
using mint = modint<P>;

struct Comb {
  int n;
  std::vector<mint> fact;
  std::vector<mint> invefact;
  std::vector<mint> inve;

  Comb() : n{0}, fact{1}, invefact{1}, inve{0} {}
  Comb(int n) : Comb() {
    init(n);
  }
  
  void init(int m) {
    if (m <= n) return;
    fact.resize(m + 1);
    invefact.resize(m + 1);
    inve.resize(m + 1);
    
    for (int i = n + 1; i <= m; i++) {
      fact[i] = fact[i - 1] * i;
    }
    invefact[m] = fact[m].inv();
    for (int i = m; i > n; i--) {
      invefact[i - 1] = invefact[i] * i;
      inve[i] = invefact[i] * fact[i - 1];
    }
    n = m;
  }
  
  mint fac(int m) {
    if (m > n) init(2 * m);
    return fact[m];
  }
  mint invfac(int m) {
    if (m > n) init(2 * m);
    return invefact[m];
  }
  mint inv(int m) {
    if (m > n) init(2 * m);
    return inve[m];
  }
  mint binom(int n, int m) {
    if (n < m || m < 0) return 0;
    return fac(n) * invfac(m) * invfac(n - m);
  }
} comb;

struct Mo {
  int X, Y;
  int ix, iy;
  mint ans;

  Mo(int A, int B) {
    X = A, Y = B;
    ix = 0, iy = 0;
    ans = comb.binom(X, Y);
  }

  void move(int x, int y) {
    while (iy < y) {
      iy++;
      ans += comb.binom(ix, iy) * comb.binom(X - ix, Y - iy);
    }
    while (iy > y) {
      ans -= comb.binom(ix, iy) * comb.binom(X - ix, Y - iy);
      iy--;
    }
    while (ix < x) {
      ans -= comb.binom(ix, iy) * comb.binom(X - 1 - ix, Y - 1 - iy);
      ix++;
      if (ix == 0) {
        ans = iy >= 0 ? comb.binom(X, Y) : 0;
      }
    }
    while (ix > x) {
      ix--;
      if (ix < 0) {
        ans = 0;
      } else {
        ans += comb.binom(ix, iy) * comb.binom(X - 1 - ix, Y - 1 - iy);
      }
    }
  }
};

void solve() {
  int n;
  std::cin >> n;

  std::vector<std::vector<int>> adj(n);
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    std::cin >> u >> v;
    u--;
    v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }

  std::string a, b;
  std::cin >> a >> b;

  std::vector<int> s1(n), t1(n), sq(n), tq(n);

  auto dfs = [&](auto self, int x, int p, int d) -> void {
    if (a[x] == '?') {
      sq[x]++;
    } else if (a[x] == d + '0') {
      s1[x]++;
    }
    if (b[x] == '?') {
      tq[x]++;
    } else if (b[x] == d + '0') {
      t1[x]++;
    }

    for (auto y : adj[x]) {
      if (y == p) {
        continue;
      }
      self(self, y, x, d ^ 1);
      sq[x] += sq[y];
      s1[x] += s1[y];
      tq[x] += tq[y];
      t1[x] += t1[y];
    }
  };
  dfs(dfs, 0, -1, 0);

  int X = sq[0] + tq[0];
  int Y = sq[0] + s1[0] - t1[0];

  std::vector<std::array<int, 2>> ask;
  for (int i = 0; i < n; i++) {
    int x = sq[i] + tq[i];
    int y = sq[i] + s1[i] - t1[i];
    ask.push_back({x, y});
  }

  constexpr int B = 710;
  std::sort(ask.begin(), ask.end(),
    [&](std::array<int, 2> i, std::array<int, 2> j) {
      if (i[0] / B != j[0] / B) {
        return i[0] < j[0];
      }
      return i[1] < j[1];
    });

  mint ans = 0;
  int ix = 0, iy = 0;
  Mo m1(X, Y), m2(X - 1, Y - 1);
  for (auto [x, y] : ask) {
    m1.move(x, y);
    m2.move(x - 1, y - 1);

    mint G = m1.ans, H = m2.ans;
    ans += 2 * (y * G - x * H) + x * comb.binom(X - 1, Y - 1) - y * comb.binom(X, Y);
  }

  std::cout << ans << "\n";
}

int main() {
  // freopen("opt.in", "r", stdin);
  // freopen("opt.out", "w", stdout);
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int t;
  std::cin >> t;

  while (t--) {
    solve();
  }

  return 0;
}