#include <bits/stdc++.h>

using i64 = long long;

constexpr int P = 1000000007;

constexpr int N = 200000;

int fac[N + 1], invfac[N + 1];

int power(int a, int b) {
    int res = 1;
    for (; b; b /= 2, a = 1LL * a * a % P) {
        if (b % 2) {
            res = 1LL * res * a % P;
        }
    }
    return res;
}

int binom(int n, int m) {
    if (n < m || m < 0) {
        return 0;
    }
    return 1LL * fac[n] * invfac[m] % P * invfac[n - m] % P;
}

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

    std::string s, t;
    std::cin >> s >> t;
    std::vector<int> s1(n), sq(n), t1(n), tq(n);
    auto dfs = [&](auto self, int x, int p, int d) -> void {
        if (s[x] == '?') {
            sq[x] = 1;
        } else if (s[x] == '0' + d) {
            s1[x] = 1;
        }
        if (t[x] == '?') {
            tq[x] = 1;
        } else if (t[x] == '0' + d) {
            t1[x] = 1;
        }
        for (auto y : adj[x]) {
            if (y == p) {
                continue;
            }
            self(self, y, x, d ^ 1);
            s1[x] += s1[y];
            sq[x] += sq[y];
            t1[x] += t1[y];
            tq[x] += tq[y];
        }
    };
    dfs(dfs, 0, -1, 0);

    int ans = 0;

    int T = t1[0] + tq[0] - s1[0];
    int Q = sq[0] + tq[0];
    // for (int i = 1; i < n; i++) {
    //     int A = t1[i] + tq[i] - s1[i];
    //     int X = sq[i] + tq[i];
    //     for (int j = 0; j <= X; j++) {
    //         ans = (ans + 1LL * binom(X, j) * binom(Q - X, T - j) % P * std::abs(j - A)) % P;
    //     }
    // }
    // std::cout << ans << "\n";

    std::vector<std::array<int, 2>> q;
    constexpr int B = 300;
    for (int i = 1; i < n; i++) {
        int A = t1[i] + tq[i] - s1[i];
        int X = sq[i] + tq[i];
        q.push_back({X, A});
    }
    std::sort(q.begin(), q.end(),
        [&](auto a, auto b) {
            if (a[0] / B != b[0] / B) {
                return a[0] < b[0];
            } else {
                return a[1] < b[1];
            }
        });
    int X = 0, A = 0;
    int F = 0, G = 0, H = 0;
    F = 1LL * binom(Q, T) * std::abs(A) % P;
    G = binom(Q, T);
    for (auto [x, a] : q) {
        while (A < a) {
            F = (F + 2LL * G - binom(Q, T) + P) % P;
            G = (G + 1LL * binom(X, A + 1) * binom(Q - X, T - A - 1)) % P;
            H = (H + 1LL * binom(X, A) * binom(Q - 1 - X, T - 1 - A)) % P;
            A++;
        }
        while (A > a) {
            A--;
            H = (H + 1LL * (P - binom(X, A)) * binom(Q - 1 - X, T - 1 - A)) % P;
            G = (G + 1LL * (P - binom(X, A + 1)) * binom(Q - X, T - A - 1)) % P;
            F = (F + 2LL * (P - G) + binom(Q, T)) % P;
        }
        while (X < x) {
            F = (F + binom(Q - 1, T - 1) + 2LL * (P - H)) % P;
            G = (G + 1LL * (P - binom(X, A)) * binom(Q - 1 - X, T - 1 - A)) % P;
            H = (H + 1LL * (P - binom(X, A - 1)) * binom(Q - 2 - X, T - 1 - A)) % P;
            X++;
        }
        while (X > x) {
            X--;
            H = (H + 1LL * binom(X, A - 1) * binom(Q - 2 - X, T - 1 - A)) % P;
            G = (G + 1LL * binom(X, A) * binom(Q - 1 - X, T - 1 - A)) % P;
            F = (F - binom(Q - 1, T - 1) + P + 2LL * H) % P;
        }
        ans = (ans + F) % P;
    }
    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    fac[0] = 1;
    for (int i = 1; i <= N; i++) {
        fac[i] = 1LL * fac[i - 1] * i % P;
    }
    invfac[N] = power(fac[N], P - 2);
    for (int i = N; i; i--) {
        invfac[i - 1] = 1LL * invfac[i] * i % P;
    }

    int t;
    std::cin >> t;

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

    return 0;
}