#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,BK=317,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],S,T;
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];

struct Node{int p,q;} h[Maxn+5];
struct Data
{
    int s,t,p,q,ans;
    inline void Clear() {ans=0; For(c,0,q) ans=(ans+1ll*C(p,c)*C(s-p,t-c))%Mod;}
    inline void Addp() {ans=(ans-1ll*C(p,q)*C(s-p-1,t-q-1)%Mod+Mod)%Mod,p++;}
    inline void Delp() {--p,ans=(ans+1ll*C(p,q)*C(s-p-1,t-q-1))%Mod;}
    inline void Addq() {++q,ans=(ans+1ll*C(p,q)*C(s-p,t-q))%Mod;}
    inline void Delq() {ans=(ans-1ll*C(p,q)*C(s-p,t-q)%Mod+Mod)%Mod,q--;}
    inline void Move(int P,int Q)
    {
        if(P<0) return;
        while(q<Q) Addq(); while(q>Q) Delq();
        while(p<P) Addp(); while(p>P) Delp();
    }
} K1,K2;

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 Work()
{
    S=B1[1]+C1[1],T=C1[1]-A1[1];
    K1.s=S,K1.t=T,K1.p=K1.q=0,K1.Clear();
    K2.s=S-1,K2.t=T-1,K2.p=K2.q=0,K2.Clear();
    For(_,1,n-1)
    {
        auto [p,q]=h[_]; int s1=0,s2=0,s3=0,s4=0;

        K1.Move(p,q-1),K2.Move(p-1,q-2);
        // K1.Clear(),K2.Clear();
        s1=(C(S,T)-K1.ans+Mod)%Mod,s2=(C(S-1,T-1)-(p<=0?0:K2.ans)+Mod)%Mod;
        int t1=0; For(c,max(0,q),n) t1=(t1+1ll*C(p,c)*C(S-p,T-c))%Mod;
        int t2=0; For(c,max(0,q-1),n) t2=(t2+1ll*C(p-1,c)*C(S-p,T-1-c))%Mod;
        ans=(ans+1ll*s2*p+1ll*(Mod-q)*s1)%Mod;

        For(c,0,min(p,q-1)) s3=(s3+1ll*C(p,c)*C(S-p,T-c))%Mod;
        For(c,0,min(p,q-2)) s4=(s4+1ll*C(p-1,c)*C(S-p,T-1-c))%Mod;
        ans=(ans+1ll*s3*q+1ll*(Mod-p)*s4)%Mod;
    }
}
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];
        int p=b+c,q=c-a; h[i-1]=Node{p,q};
    }
    sort(h+1,h+n,[&](Node x,Node y){
        if(x.p/BK!=y.p/BK) return x.p<y.p;
        else return x.q<y.q;
    }); Work();
    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;
}