-
Notifications
You must be signed in to change notification settings - Fork 0
/
C.cpp
131 lines (110 loc) · 3.84 KB
/
C.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < b; i++)
#define repR(i, a, b) for(int i = a; i >= b; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD1 1000000007
#define MOD2 998244353
#define INF 2000000000000000000
#define ps(x,y) fixed << setprecision(y) << x
#define fastio ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//member functions :
//1. order_of_key(k) : number of elements strictly lesser than k
//2. find_by_order(k) : k-th element in the set
/*---------------------------------------------------------Debugging----------------------------------------------------------*/
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _print(x); cerr << endl;
#else
#define debug(x)
#endif
void _print(int t) {cerr << t;}
void _print(ll t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(double t) {cerr << t;}
void _print(lld t) {cerr << t;}
void _print(ull t) {cerr << t;}
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.ff); cerr << ","; _print(p.ss); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
/*----------------------------------------------------------------------------------------------------------------------------*/
vector<vector<int>> adj;
vector<pair<ll, ll>> range;
vector<vector<ll>> dp;
// dp[i][0] = max ans in the subtree of i when the chosen value in ith node is l
// dp[i][1] = max ans in the subtree of i when the chosen value in ith node is r
// Transitions
// dp[u][0] = max(abs(u[l] - v[l]) + dp[v][0], abs(u[l] - v[r]) + dp[v][1])
// dp[u][1] = max(abs(u[r] - v[l]) + dp[v][0], abs(u[r] - v[r]) + dp[v][1])
void dfs(int u, int p = -1)
{
for (auto v : adj[u]) {
if (v != p) {
dfs(v, u);
dp[u][0] += max(abs(range[u].ff - range[v].ff) + dp[v][0], abs(range[u].ff - range[v].ss) + dp[v][1]);
dp[u][1] += max(abs(range[u].ss - range[v].ff) + dp[v][0], abs(range[u].ss - range[v].ss) + dp[v][1]);
}
}
}
void solve()
{
int n;
cin >> n;
adj.clear();
range.clear();
dp.clear();
adj.resize(n + 1);
range.resize(n + 1);
rep(i, 1, n + 1) {
cin >> range[i].ff >> range[i].ss;
}
rep(i, 0, n - 1) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
adj[v].pb(u);
}
dp = vector<vector<ll>> (n + 1, vector<ll> (2, 0));
dfs(1);
cout << max(dp[1][0], dp[1][1]) << '\n';
}
int main()
{
#ifndef ONLINE_JUDGE
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
freopen("Error.txt", "w", stderr);
#endif
fastio;
int t = 1;
cin >> t;
while (t--) solve();
return 0;
}