#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
using namespace std;
const int N = 20500;
const int M = 80000;
const int P = 16;
int dis[P][P],dx[P];
int n,m;
int dr[N];
int point[N],to[M],next[M],cc;
int tot[N],depth[N],fa[N],num[N],numx[N],top[N];
struct Info
{
    int val[P];
    Info operator + (Info x)const
    {
        Info res;
        int i;
        for(i=0;i<P;i++)
            res.val[i]=x.val[i]+val[i];
        return res;
    }
};
struct Node
{
    Node *lson,*rson;
    int l,r,mid,tot;
    Info val;
    int lan;
}tree[M];
int getint()
{
    int res=0;
    char ch=getchar();
    while((ch<'0' || ch>'9') && ch!='-')
        ch=getchar();
    bool fan=0;
    if(ch=='-')
    {
        fan=1;
        ch=getchar();
    }
    while('0'<=ch && ch<='9')
    {
        res=res*10+ch-'0';
        ch=getchar();
    }
    if(fan)
        res=-res;
    return res;
}
int GetMatrix()
{
    int now=0;
    int t;
    t=getint();
    if(t)
        now|=8;
    t=getint();
    if(t)
        now|=4;
    t=getint();
    if(t)
        now|=2;
    t=getint();
    if(t)
        now|=1;
    return now;
}
void Init()
{
    int i,j;
    for(i=0;i<P;i++)
    {
        int now=0;
        if(i&1)
            now|=2;
        if(i&2)
            now|=8;
        if(i&8)
            now|=4;
        if(i&4)
            now|=1;
        dx[i]=now;
    }
    for(i=0;i<P;i++)
    {
        for(j=0;j<P;j++)
        {
            dis[i][j]=10;
            int now=i;
            if(now==j)
                dis[i][j]=min(dis[i][j],0);
            now=dx[now];
            if(now==j)
                dis[i][j]=min(dis[i][j],2);
            now=dx[now];
            if(now==j)
                dis[i][j]=min(dis[i][j],4);
            now=dx[now];
            if(now==j)
                dis[i][j]=min(dis[i][j],6);
        }
    }
}
void AddEdge(int x,int y)
{
    cc++;
    next[cc]=point[x];
    point[x]=cc;
    to[cc]=y;
}
void MakeFa(int x,int y)
{
    fa[x]=y;
    depth[x]=depth[y]+1;
    tot[x]=1;
    int now=point[x];
    while(now)
    {
        int tox=to[now];
        if(tox!=y)
        {
            MakeFa(tox,x);
            tot[x]+=tot[tox];
        }
        now=next[now];
    }
}
void MakeLian(int x,int y,int grand)
{
    num[x]=y;
    numx[y]=x;
    top[x]=grand;
    y++;
    int now=point[x],prefer=0;
    while(now)
    {
        int tox=to[now];
        if(tox!=fa[x] && tot[tox]>tot[prefer])
            prefer=tox;
        now=next[now];
    }
    if(!prefer)
        return;
    MakeLian(prefer,y,grand);
    y+=tot[prefer];
    now=point[x];
    while(now)
    {
        int tox=to[now];
        if(tox!=fa[x] && tox!=prefer)
        {
            MakeLian(tox,y,tox);
            y+=tot[tox];
        }
        now=next[now];
    }
}
void Replace(Node *x)
{
    x->val=x->lson->val+x->rson->val;
}
void MakeTree(int x,int l,int r)
{
    tree[x].l=l;
    tree[x].r=r;
    tree[x].tot=r-l+1;
    tree[x].lan=-1;
    if(l<r)
    {
        tree[x].mid=(l+r)/2;
        tree[x].lson=tree+(x*2);
        tree[x].rson=tree+(x*2+1);
        MakeTree(x*2,l,tree[x].mid);
        MakeTree(x*2+1,tree[x].mid+1,r);
        Replace(tree+x);
    }
    else
    {
        int i;
        for(i=0;i<P;i++)
            tree[x].val.val[i]=0;
        tree[x].val.val[dr[numx[l]]]=1;
    }
}
void GetData()
{
    cc=0;
    memset(point,0,sizeof point);
    int i;
    for(i=1;i<n;i++)
    {
        int a=getint();
        int b=getint();
        AddEdge(a,b);
        AddEdge(b,a);
    }
    for(i=1;i<=n;i++)
        dr[i]=GetMatrix();
    MakeFa(1,0);
    MakeLian(1,1,1);
    MakeTree(1,1,n);
}
void ChangeX(Node *x,int y)
{
    int i;
    for(i=0;i<P;i++)
        x->val.val[i]=0;
    x->val.val[y]=x->tot;
    x->lan=y;
}
void Clear(Node *x)
{
    if(x->lan!=-1)
    {
        ChangeX(x->lson,x->lan);
        ChangeX(x->rson,x->lan);
        x->lan=-1;
    }
}
Info Find(Node *x,int l,int r)
{
    if(x->l==l && x->r==r)
        return x->val;
    Clear(x);
    if(r<=x->mid)
        return Find(x->lson,l,r);
    if(l>x->mid)
        return Find(x->rson,l,r);
    return Find(x->lson,l,x->mid)+Find(x->rson,x->mid+1,r);
}
void Change(Node *x,int l,int r,int v)
{
    if(x->l==l && x->r==r)
    {
        ChangeX(x,v);
        return;
    }
    Clear(x);
    if(r<=x->mid)
        Change(x->lson,l,r,v);
    else if(l>x->mid)
        Change(x->rson,l,r,v);
    else
    {
        Change(x->lson,l,x->mid,v);
        Change(x->rson,x->mid+1,r,v);
    }
    Replace(x);
}
void GetAns(int x,int y,int z)
{
    int i;
    Info res;
    for(i=0;i<P;i++)
        res.val[i]=0;
    while(top[x]!=top[y])
    {
        if(depth[top[x]]<depth[top[y]])
        {
            res=res+Find(tree+1,num[top[y]],num[y]);
            Change(tree+1,num[top[y]],num[y],z);
            y=fa[top[y]];
        }
        else
        {
            res=res+Find(tree+1,num[top[x]],num[x]);
            Change(tree+1,num[top[x]],num[x],z);
            x=fa[top[x]];
        }
    }
    if(depth[x]<depth[y])
    {
        res=res+Find(tree+1,num[x],num[y]);
        Change(tree+1,num[x],num[y],z);
    }
    else
    {
        res=res+Find(tree+1,num[y],num[x]);
        Change(tree+1,num[y],num[x],z);
    }
    int ans=0;
    for(i=0;i<P;i++)
        ans+=res.val[i]*dis[i][z];
    printf("%d\n",ans);
}
void DoIt()
{
    m=getint();
    while(m--)
    {
        int a=getint();
        int b=getint();
        int c=GetMatrix();
        GetAns(a,b,c);
    }
}
void f()
{
    GetData();
    DoIt();
}
int main()
{
    Init();
    int T=getint();
    while((scanf("%d",&n))!=EOF)
        f();
    return 0;
}