E-Tree Xor_2021牛客暑期多校训练营4

时间限制：C/C++/Rust/Pascal 2秒，其他语言4秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

Bob has a tree with $n$ nodes and the weight of i-th node is $w_i$ .

But Bob forgot $w_{1...n}$ , he only remembers $w_i$ is an integer in $[l_i,r_i]$ and $w_u~xor~w_v$ for each edge $(u,v)$ in the tree.

Now Bob wants to know the number of possible values of $w_{1...n}$ .

XOR means bitwise exclusive OR

输入描述:

The first line has one integers .

Then there are  lines, the i-th line has two integers .

Then there are  lines, each line has three integers  denote the infomation for each edge.

输出描述:

Output the answer.

示例1

输入

复制

输出

复制