There are multiple test cases. The first line of the input contains an integer $T$, indicating the number of test cases. For each test case:
The second line contains one interger $n$, indicating the number od cities. $(1\leq n \leq 10^5)$
It's guaranteed that $\Sigma n\leq 3*10^5$
The next line contains $n$ interger $f_i$, the $i-th$ interger indicates the citizens' favorability of art in city $i$.($0\leq f_i\leq 2*10^9)$
The next line contains $n$ interger $y_i$, the $i-th$ interger indicates the number of works Sindar will donate to the orphanage in city $i$.$(0\leq y_i\leq 10^4)$
Each of the following $n-1$ lines contains two intergers $u,v$ indicating that there is a road between city $u$ and city $v$. ($1\leq u,v \leq n$)
The next line contains two interger $q$,indicating the number of tours and the number of works Sindar will donate to the local orphanage.$(1\leq q \leq 10^5)$
Each of the next $q$ lines contains one instruction. And there are two kinds of instructions:
$1\ s\ t\ x$ indicates the start city ,the end city and the number of works Sindar owns at first. $(1\leq s,t\leq n , s\neq t,x\leq 2*10^9)$
$2\ c\ v$ indicates Sindar wants to change the favorability of city $c$ to $v$.$(1\leq c\leq n,0\leq v\leq 2*10^9)$
It is guaranteed that $x \geq dis(s,t)*y$. $dis(s,t)$ indicates the number of cities you must pass from $s$ to $t$.