#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5 , MOD = 1e9 + 7;
int n , res , a[N] , b[N] , ca[N][3] , cb[N][3];
string aa , bb; vector<int>e[N];
int Qpow(ll x , ll p)
{
	ll res = 1;
	x %= MOD , p %= MOD - 1;
	if(p < 0)p += MOD - 1;
	for(; p ; p >>= 1 , x = x * x % MOD) 
		if(p & 1)res = res * x % MOD;
	return res;
}
int fac[N * 2] , ifac[N * 2];
void Init(int n)
{
	fac[0] = ifac[0] = 1;
	for(int i = 1 ; i <= n ; i++)
		fac[i] = (ll)fac[i - 1] * i % MOD;
	ifac[n] = Qpow(fac[n] , MOD - 2);
	for(int i = n - 1 ; i >= 1 ; i--)
		ifac[i] = (ll)ifac[i + 1] * (i + 1) % MOD;
}
int C(int n , int m)
{
	if(n < m || m < 0)return 0;
	return (ll)fac[n] * ifac[m] % MOD * ifac[n - m] % MOD;
}
void Dfs(int u , int fa , int dep = 1)
{
	if(a[u] != -1)a[u] ^= (dep & 1);
	ca[u][a[u] + 1]++;
	if(b[u] != -1)b[u] ^= (dep & 1);
	cb[u][b[u] + 1]++;
	for(int v : e[u])
	{
		if(v == fa)continue ;
		Dfs(v , u , dep + 1);
		for(int i = 0 ; i < 3 ; i++)
		{
			ca[u][i] += ca[v][i];
			cb[u][i] += cb[v][i];
		}
	}
}
int Solve()
{
	cin >> n; 
	for(int i = 1 ; i <= n ; i++)e[i].clear();
	for(int i = 1 ; i < n ; i++)
	{
		int u , v; cin >> u >> v;
		e[u].push_back(v);
		e[v].push_back(u);
	}
	cin >> aa >> bb;
	for(int i = 0 ; i < n ; i++)
	{
		a[i + 1] = aa[i] == '?' ? -1 : aa[i] - '0';
		b[i + 1] = bb[i] == '?' ? -1 : bb[i] - '0';
	}
	memset(ca , 0 , sizeof(int) * (n + 1) * 3);
	memset(cb , 0 , sizeof(int) * (n + 1) * 3);
	Dfs(1 , 0);
	int A = ca[1][0] , B = cb[1][0] , Z = ca[1][2] - cb[1][2] , ans = 0;
	// cerr << A << " " << B << " " << Z << "\n";
	for(int u = 1 ; u <= n ; u++)
	{
		int x = ca[u][0] , y = cb[u][0] , z = ca[u][2] - cb[u][2];
		for(int p = -y ; p <= x ; p++)
			ans = (ans + (ll)C(x + y , x - p) * C(A + B - x - y , A - x + Z + p) % MOD * abs(z + p)) % MOD;
	}
	cout << ans << "\n";
	return 0;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0) , cout.tie(0);
	Init(2e5); int T; cin >> T;
	while(T--)Solve();
	return 0;
}