#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int n,fa[N];
vector<int>g[N];
#define pb push_back
char c1[N],c2[N];
const int mod=1e9+7;
int qpow(int a,int b){
    int c=1;
    for(;b;b>>=1){
        if(b&1)c=1ll*a*c%mod;
        a=1ll*a*a%mod;
    }
    return c;
}
int s[N][2][3],jc[N],ij[N],sz[N];
int C(int a,int b){if(a<0||b<0||a<b)return 0;return 1ll*jc[a]*ij[b]%mod*ij[a-b]%mod;}
void doi(){jc[0]=ij[0]=1;for(int i=1;i<=200000;i++)jc[i]=1ll*i*jc[i-1]%mod,ij[i]=qpow(jc[i],mod-2);}
void dfs(int x,int d){
    sz[x]=1;
    for(int v:g[x])if(v!=fa[x]){
        fa[v]=x,dfs(v,d^1),sz[x]+=sz[v];
        for(int i=0;i<2;i++)for(int j=0;j<3;j++)s[x][i][j]+=s[v][i][j];
    }
    if(c1[x]!='?')s[x][0][(c1[x]-'0')^d]++;
    else s[x][0][2]++;
    if(c2[x]!='?')s[x][1][(c2[x]-'0')^d]++;
    else s[x][1][2]++;
}
void sol(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        g[i].clear(),fa[i]=0;
        for(int j=0;j<2;j++)for(int k=0;k<3;k++)s[i][j][k]=0;
    }
    for(int i=1,u,v;i<n;i++)scanf("%d%d",&u,&v),g[u].pb(v),g[v].pb(u);
    scanf("%s%s",c1+1,c2+1);dfs(1,0);
    int ans=0,X=-(s[1][0][1]-s[1][1][2]-s[1][1][1]),E=s[1][0][2]+s[1][1][2];
    if(X<0){puts("0");return;}
    for(int i=2;i<=n;i++){
        int a=s[i][0][1]-s[i][1][2]-s[i][1][1],b=s[i][0][2]+s[i][1][2],B=E-b;
        for(int j=0;j<=b&&j<=X;j++)if(X-j<=E-b)
        (ans+=1ll*C(E-b,X-j)*abs(a+j)%mod*C(b,j)%mod)%=mod;
    }
    printf("%d\n",ans);
}
int main(){
    doi();
    int T;scanf("%d",&T);while(T--)sol();
    return 0;
}