#include <bits/stdc++.h>
using namespace std;

namespace SOL {

using i64 = long long;
void debug(const char *msg, ...) {
#ifdef CLESIP
    va_list arg;
    static char pbString[512];
    va_start(arg,msg);
    vsprintf(pbString,msg,arg);
    cerr << "[DEBUG] " << pbString << "\n";
    va_end(arg);
#endif    
}
template<typename T, typename L>
bool chkmax(T &x, L y) { if (x < y) return x = y, true; return false; }
template<typename T, typename L>
bool chkmin(T &x, L y) { if (y < x) return x = y, true; return false; }

const int N = 2e5 + 10;
const i64 P = 1e9 + 7;
int n, dep[N], asum[2], acnt[2];
i64 fac[N], inv[N], ans;
char s[N], t[N];
vector<int> G[N];

void init() {
	fac[0] = inv[0] = inv[1] = 1;
	for (int i = 1; i < N; i ++)
		fac[i] = fac[i - 1] * i % P;
	for (int i = 2; i < N; i ++)
		inv[i] = (P - P / i) * inv[P % i] % P;
	for (int i = 1; i < N; i ++)
		inv[i] = inv[i - 1] * inv[i] % P;
}

void mod(i64 &x, i64 y) {
	x += y;
	if (x >= P)
		x -= P;
}

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

char flip(char ch) {
	if (ch == '?')
		return '?';
	if (ch == '0')
		return '1';
	return '0';
}

int sum[2][N], cnt[2][N];

void flip_dfs(int x, int fa) {
	dep[x] = dep[fa] + 1;
	if (dep[x] & 1) {
		s[x] = flip(s[x]);
		t[x] = flip(t[x]);
	}
	for (int y : G[x]) if (y != fa)
		flip_dfs(y, x);
}

void dfs(int x, int fa) {
	for (int i = 0; i < 2; i ++)
		sum[i][x] = cnt[i][x] = 0;
	sum[0][x] += (s[x] == '1'), sum[1][x] += (t[x] == '1');
	cnt[0][x] += (s[x] == '?'), cnt[1][x] += (t[x] == '?');
	for (int y : G[x]) if (y != fa) {
		dfs(y, x);
		for (int i = 0; i < 2; i ++)
			sum[i][x] += sum[i][y], cnt[i][x] += cnt[i][y];
	}
	// debug("x: %d (%d, %d) (%d, %d)", x, sum[0][x], sum[1][x], cnt[0][x], cnt[1][x]);
	for (int i = 0; i <= acnt[0] + asum[0] && i <= acnt[1] + asum[1]; i ++)
		for (int j = 0; j <= cnt[0][x] && j + asum[0] <= i; j ++)
			for (int k = 0; k <= cnt[1][x] && k + asum[1] <= i; k ++)
				mod(ans, abs(sum[0][x] - sum[1][x] + j - k) * binom(cnt[0][x], j) % P * binom(cnt[1][x], k) % P * binom(acnt[0] - cnt[0][x], i - asum[0] - j) % P * binom(acnt[1] - cnt[1][x], i - asum[1] - k) % P);
}

void solve() {
	cin >> n;
	ans = 0;
	for (int i = 1; i <= n; i ++)
		G[i].clear();
	for (int i = 1, x, y; i < n; i ++) {
		cin >> x >> y;
		G[x].push_back(y), G[y].push_back(x);
	}
	cin >> (s + 1) >> (t + 1);
	for (int i = 0; i < 2; i ++)
		asum[i] = acnt[i] = 0;
	flip_dfs(1, 0);
	for (int i = 1; i <= n; i ++) {
		asum[0] += (s[i] == '1'), asum[1] += (t[i] == '1');
		acnt[0] += (s[i] == '?'), acnt[1] += (t[i] == '?');
	}
	dfs(1, 0);
	cout << ans << "\n";
}

}
int main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	SOL::init();
	int tt; cin >> tt;
	while (tt --)
		SOL::solve();
	return 0;
}