#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=2e5,Mod=1e9+7;

inline int Pow(int x,int y)
{
    int res=1;
    while(y)
    {
        if(y&1) res=1ll*res*x%Mod;
        x=1ll*x*x%Mod,y>>=1;
    }
    return res;
}

int n,ans,fac[Maxn+5],inv[Maxn+5]; char s[Maxn+5],t[Maxn+5];
int A1[Maxn+5],B1[Maxn+5],C1[Maxn+5];
inline int C(int x,int y) {return (x<y || y<0)?0:1ll*fac[x]*inv[x-y]%Mod*inv[y]%Mod;}
vector<int> v[Maxn+5];

inline void dfs(int x,int f,int d)
{
    int sx=(s[x]=='?'?2:s[x]-'0'),tx=(t[x]=='?'?2:t[x]-'0');
    if(d&1) {if(sx<=1) sx^=1; if(tx<=1) tx^=1;}
    A1[x]=(sx==0)-(tx==0),B1[x]=(sx==2),C1[x]=(tx==2);
    for(auto y:v[x]) if(y!=f) dfs(y,x,d+1),A1[x]+=A1[y],B1[x]+=B1[y],C1[x]+=C1[y];
}
inline void Solve()
{
    cin>>n; ans=0; For(i,1,n-1)
    {
        int a,b; cin>>a>>b;
        v[a].push_back(b),v[b].push_back(a);
    } scanf("%s%s",s+1,t+1); dfs(1,0,0);
    For(i,2,n)
    {
        int a=A1[i],b=B1[i],c=C1[i],d=A1[1]-A1[i],e=B1[1]-B1[i],f=C1[1]-C1[i];
        // cerr<<i<<' '<<a<<' '<<b<<' '<<c<<' '<<d<<' '<<e<<' '<<f<<endl;
        For(k,-n,n) For(p,0,b) For(q,0,e)
            ans=(ans+1ll*C(b,p)*C(c,a+p-k)%Mod*C(e,q)%Mod*C(f,d+q+k)%Mod*abs(k))%Mod;
    } cout<<ans<<endl; For(i,1,n) vector<int>().swap(v[i]);
}

int main()
{
    // freopen("1.in","r",stdin);

    int T; cin>>T; fac[0]=inv[0]=1;
    For(i,1,Maxn) fac[i]=1ll*fac[i-1]*i%Mod;
    inv[Maxn]=Pow(fac[Maxn],Mod-2)%Mod;
    Rof(i,Maxn-1,1) inv[i]=1ll*inv[i+1]*(i+1)%Mod;
    while(T--) Solve();
    return 0;
}