#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long 
#define vi vector < int > 
#define sz(a) ((int) (a).size())
#define ll long long 
#define ull unsigned long long
#define me(a, x) memset(a, x, sizeof(a)) 
using namespace std;
const int N = 1 << 19, mod = 1e9 + 7;

int qpow(int x, int y = mod - 2) {
	int res = 1;
	for(; y; x = (ll) x * x % mod, y >>= 1) if(y & 1) res = (ll) res * x % mod;
	return res;
}
int fac[N], ifac[N], inv[N];
void init(int x) {
	fac[0] = ifac[0] = inv[1] = 1;
	L(i, 2, x) inv[i] = (ll) (mod - mod / i) * inv[mod % i] % mod;
	L(i, 1, x) fac[i] = (ll) fac[i - 1] * i % mod, ifac[i] = (ll) ifac[i - 1] * inv[i] % mod;
} 
int C(int x, int y) {
	return x < y || y < 0 ? 0 : (ll) fac[x] * ifac[y] % mod * ifac[x - y] % mod;
}

int n;
char s[N], t[N];
vi e[N];

int scnt[N], snon[N];
int tcnt[N], tnon[N];
int col[N];
void dfs(int x, int fa) {
	if(col[x]) {
		if(s[x] != '?') 
			s[x] ^= 1;
		if(t[x] != '?') 
			t[x] ^= 1;
	} 
	scnt[x] = s[x] == '1';
	snon[x] = s[x] == '?';
	
	tcnt[x] = t[x] == '1';
	tnon[x] = t[x] == '?';
	for(auto v : e[x]) if(v != fa) {
		col[v] = col[x] ^ 1, dfs(v, x);
		scnt[x] += scnt[v];
		snon[x] += snon[v];
		
		tcnt[x] += tcnt[v];
		tnon[x] += tnon[v];
	}
}

struct node {
	int L, D;
} ask[N];
int top;

int B;

struct Q {
	int pn, all;
	int L, D;
	int ans1;
	inline void recalc() {
		ans1 = 0;
		L(a, 0, D) 
			(ans1 += (ll) C(L, a) * C(all - L, pn - a) % mod) %= mod;
	}
	Q(int P = 0, int A = 0) {
		pn = P, all = A; 
		L = 0, D = 0;
		recalc();
	}
	void move(int l, int d) {
		while(L < l) {
			(ans1 += mod - (ll) C(L, D) * C(all - L - 1, pn - D - 1) % mod) %= mod;
			++L;
			if(L == 0) recalc();
		}
		while(L > l) {
			--L;
			if(L < 0) recalc();
			(ans1 += (ll) C(L, D) * C(all - L - 1, pn - D - 1) % mod) %= mod;
		}
		while(D < d) {
			++D;
			(ans1 += (ll) C(L, D) * C(all - L, pn - D) % mod) %= mod;
		}
		while(D > d) {
			(ans1 += mod - (ll) C(L, D) * C(all - L, pn - D) % mod) %= mod;
			--D;
		}
	}
} CUR1, CUR2;

void Main() {
	cin >> n;
	B = sqrt(n);
	L(i, 1, n - 1) {
		int u, v;
		cin >> u >> v;
		e[u].emplace_back(v);
		e[v].emplace_back(u);
	}
	cin >> (s + 1) >> (t + 1);
	col[1] = 0, dfs(1, 0);
	
	int ans = 0;
	
	int pn = tnon[1] + tcnt[1] - scnt[1];
	int all = snon[1] + tnon[1];
	
	top = 0;
	L(i, 2, n) {
		int sx = snon[i]; 
		int sy = snon[1] - snon[i];
		
		int tx = tnon[i]; 
		int ty = tnon[1] - tnon[i];
		
		int L = sx + tx, R = sy + ty, D = tx + tcnt[i] - scnt[i];
		++top;
		ask[top].L = L;
		ask[top].D = D;
	}
	sort(ask + 1, ask + top + 1, [&] (node a, node b) {
		return a.L / B == b.L / B ? a.D < b.D : a.L < b.L;
	});
	
	CUR1 = Q(pn, all);
	CUR2 = Q(pn - 1, all - 1);
	L(i, 1, top) {
		int L = ask[i].L, D = ask[i].D;
		
		if(L < 0 || L > all) continue;
		(ans += (ll) (mod - D) * C(all, pn) % mod) %= mod;
		(ans += (ll) L * C(all - 1, pn - 1) % mod) %= mod;
		
		CUR1.move(L, D);
		CUR2.move(L - 1, D - 1);
		(ans += (ll) CUR1.ans1 * (D + mod) * 2 % mod) %= mod;
		(ans += (ll) CUR2.ans1 * (mod - L * 2) % mod) %= mod;
		
//		L(a, 0, D) {
//			(ans += (ll) C(L, a) * C(all - L, pn - a) % mod * D * 2 % mod) %= mod;
//		}
//		L(a, 0, D - 1) {
//			(ans += (ll) C(L - 1, a) * C(all - L, pn - a - 1) % mod * (mod - L * 2) % mod) %= mod;
//		}

//		CUR.move(L, D);
//		(ans += CUR.ans2) %= mod;
	}
	
	cout << ans << '\n';
	
	L(i, 1, n) {
		e[i].clear();
	}
}

int main() {
	init(2e5 + 7);
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int t; cin >> t; while(t--) Main();
	return 0;
}