Tangling Tree

You are given an undirected tree of $N$ nodes. A positive weight $W_i$ is assigned to the node $i$ for all $1 \le i \le N$. For all $1 \le j \le N-1$, the $j$-th edge connects the nodes $u_j$ and $v_j$, and has a restriction value of $R_j$. An array $A_1, A_2, \cdots, A_N$ consisting of $N$ non-negative integers is called **valid** if: - For all $1 \le j \leq N-1$, the condition $A_{u_j}+A_{v_j}