// Hydro submission #6747b0689592d6097b871741@1732751464463
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>

#define N 100009
#define LL long long
#define pii pair<int,int>
using namespace std;
int n,idx=1,h[N],eg[N*2],ne[N*2],fa[N],die[N];
int tim[N];
LL a[N],b[N];
struct node1{
    LL a,b;
    int t,id;
    bool operator<(const node1 c)const{
        return a>c.a;
    }
};
struct node2{
    LL a,b;
    int t,id;
    bool operator<(const node2 c)const{
        return b<c.b;
    }
};
priority_queue<node1> q1;
priority_queue<node2> q2;
void add(int a,int b){
    ++idx,eg[idx]=b,ne[idx]=h[a],h[a]=idx;
}
void dfs(int u){
    for(int y,i=h[u];i;i=ne[i]){
        y=eg[i];
        if(y==die[u]) continue;
        die[y]=u;
        dfs(y);
    }
}
int find(int u){
    if(fa[u]==u) return u;
    return fa[u]=find(fa[u]);
}
void solve(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++) fa[i]=i,tim[i]=h[i]=0;
    a[1]=b[1]=0;
    idx=1;
    for(int i=2;i<=n;i++) scanf("%lld%lld",&a[i],&b[i]);
    for(int a,b,i=1;i<n;i++){
        scanf("%d%d",&a,&b);
        add(a,b);
        add(b,a);
    }
    dfs(1);
    for(int i=1;i<=n;i++){
        if(a[i]<=b[i]) q1.push({a[i],b[i],0,i});
        else q2.push({a[i],b[i],0,i});
    }
    int tot=0;
    while(q1.size() || q2.size()){
        if(q1.size()){
            node1 u=q1.top();
            q1.pop();
            if(u.t<tim[u.id]) continue;
            int y=find(u.id);
            if(y>1){
                int t=find(die[y]);
                fa[y]=t;
                LL mb=-a[t]+b[t]-a[y]+b[y];
                a[t]=-min(-a[t],-a[t]+b[t]-a[y]);
                b[t]=mb+a[t];
                tim[t]=++tot;
                if(a[t]<=b[t]) q1.push({a[t],b[t],tot,t});
                else q2.push({a[t],b[t],tot,t});
            }
        }else{
            node2 u=q2.top();
            q2.pop();
            if(u.t<tim[u.id]) continue;
            int y=find(u.id);
            if(y>1){
                int t=find(die[y]);
                fa[y]=t;
                LL mb=-a[t]+b[t]-a[y]+b[y];
                a[t]=-min(-a[t],-a[t]+b[t]-a[y]);
                b[t]=mb+a[t];
                tim[t]=++tot;
                if(a[t]<=b[t]) q1.push({a[t],b[t],tot,t});
                else q2.push({a[t],b[t],tot,t});
            }
        }
    }
    printf("%lld",a[1]);
}
int main() {
    int t;
    scanf("%d",&t);
    for(int i=1;i<=t;i++) solve();
    // freopen("tree.in","r",stdin);
    // freopen("tree.out","w",stdout);
    
    return 0;
}