#include <bits/stdc++.h>
#define int long long
using namespace std;

struct Node {
    int sub, add, gain, id = 0;
};

const int N = 2e5 + 42;

Node node[N];
vector<int> adj[N];
int n, fa[N], uf[N];

int F(int i) {
    if(uf[i] == i)
        return i;
    return uf[i] = F(uf[i]);
}

int U(int a, int b) {
    a = F(a), b = F(b);
    uf[b] = a;
    return a;
}

void dfs(int i, int pre = 0) {
    fa[i] = pre;
    for(int j : adj[i]) if(j != pre)
        dfs(j, i);
}

Node add(Node a, Node b) {
    int gain = a.gain + b.gain,
        requis = max(a.sub, a.sub - a.add + b.sub);
    return {requis, requis + gain, gain, U(a.id, b.id)};
}

bool cmp(Node a, Node b) {
    if(a.gain <= 0 && b.gain <= 0) {
        if(a.add == b.add) {
            if(a.sub == b.sub)
                return a.id < b.id;
            return a.sub < b.sub;
        }
        return a.add < b.add;
    }
    if(a.gain >= 0 && b.gain >= 0) {
        if(a.sub == b.sub) {
            if(a.add == b.add)
                return a.id < b.id;
            return a.add < b.add;
        }
        return a.sub > b.sub;
    }
    return a.gain < b.gain;
}

void solve() {
    cin >> n;
    for(int i = 0; i < n; i++)
        uf[i] = i;
    for(int i = 0; i < n; i++)
        adj[i].clear();
    node[0].sub = node[0].add = node[0].id = node[0].gain = 0;
    for(int i = 1; i < n; i++) {
        node[i].id = i;
        cin >> node[i].sub >> node[i].add;
        node[i].gain = node[i].add - node[i].sub;
    }
    for(int i = 1; i < n; i++) {
        int a, b; cin >> a >> b;
        a--, b--;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    dfs(0);

    priority_queue<Node, vector<Node>, function<bool(Node, Node)>> nds(cmp);
    for(int i = 1; i < n; i++)
        nds.push(node[i]);
    while(!nds.empty()) {
        Node nd = nds.top();
        nds.pop();
        int i = F(nd.id);
        //cout << "test " << i << ' ' << nd.id << ' ' << nd.sub << ' ' << nd.add << '\n';
        if(i != 0 && i == nd.id && nd.sub == node[i].sub && nd.add == node[i].add) {
            int anc = F(fa[i]);
            node[anc] = add(node[anc], node[i]);
            //cout << "new " << i << ' ' << anc << ' ' << node[anc].sub << ' ' << node[anc].add << '\n';
            nds.push(node[anc]);
        }
    }
    cout << node[F(0)].sub << '\n';
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int nbt; cin >> nbt;
    while(nbt--)
        solve();
}