// Hydro submission #67470fd39592d6097b86f6db@1732710355777
#include <bits/stdc++.h>
using namespace std;
int read() {
    int x = 0, f = 1; char c = getchar();
    while (c < '0' || c > '9') {if (c == '-') f = -f; c = getchar();}
    while (c >= '0' && c <= '9') {x = x * 10 + (c ^ 48); c = getchar();}
    return x * f;
}
typedef pair <int, int> pii;
typedef long long LL;
const int N = 1e5 + 5;
int n;
LL ans;
vector <int> e[N];
LL a[N], b[N];
int fa[N], f[N], vis[N];
struct Node {
    LL a, b;
    int x;
    bool operator < (const Node &B) const {
        int op1 = (a <= b), op2 = (B.a <= B.b);
        if (op1 ^ op2) return op1 < op2;
        if (op1) return a > B.a;
        return b < B.b;
    }
} ;
priority_queue <Node> Q;
void dfs(int x, int dad) {
    fa[x] = dad;
    for (int y : e[x]) {
        if (y == dad) continue;
        dfs(y, x);
    }
}
int find(int x) {
    return x == f[x] ? x : f[x] = find(f[x]);
}
void Solve() {
    n = read();
    for (int i = 1; i <= n; i++) e[i].clear(), vis[i] = 0;
    for (int i = 2; i <= n; i++) {
        a[i] = read();
        b[i] = read();
    }
    for (int i = 1; i < n; i++) {
        int u = read(), v = read();
        e[u].push_back(v);
        e[v].push_back(u);
    }
    dfs(1, 0);
    for (int i = 1; i <= n; i++) f[i] = i;
    for (int i = 2; i <= n; i++) Q.push((Node){a[i], b[i], i});
    LL s = 0;
    while (Q.size()) {
        Node p = Q.top(); Q.pop(); int x = p.x;
        if (vis[x]) continue;
        int y = find(fa[x]); vis[x] = 1;
        if (y == 1 || vis[y]) {
            s += a[x]; ans = max(ans, s);
            s -= b[x]; continue;
        }
        LL c = max(a[y], a[y] + a[x] - b[y]);
        b[y] = b[y] + b[x] - a[x] - a[y] + c; a[y] = c;
        Q.push((Node){a[y], b[y], y}); f[x] = y;
    }
    printf("%lld\n", ans);
}
int main() {
    // freopen(".in", "r", stdin);
    // freopen(".out", "w", stdout);
    int _ = read();
    while (_--) Solve();
    return 0;
}