A11159 | Red-Black Cobweb

Slastyona likes to watch life of nearby grove's dwellers. This time she watches a strange red-black spider sitting at the center of a huge cobweb.

The cobweb is a set of $n$ nodes connected by threads, each of the treads is either red of black. Using these threads, the spider can move between nodes. No thread connects a node to itself, and between any two nodes there is a unique sequence of threads connecting them.

Slastyona decided to study some special qualities of the cobweb. She noticed that each of the threads has a value of clamminess $x$ .

However, Slastyona is mostly interested in jelliness of the cobweb. Consider those of the shortest paths between each pair of nodes on which the numbers of red and black threads differ at most twice. For each such path compute the product of the clamminess of threads on the path.The jelliness of the cobweb is the product of all obtained values among all paths. Those paths that differ by direction only are counted only once.

Of course, this number can be huge, so Slastyona asks you to compute the jelliness of the given cobweb and print the answer modulo $10^{9}+7$ .

The first line contains the number of nodes $n$ $(2<=n<=10^{5})$ .

The next $n-1$ lines contain four integers each, denoting the $i$ -th thread of the cobweb: the nodes it connects $u_{i},v_{i}$ $(1<=u_{i}<=n,1<=v_{i}<=n)$ , the clamminess of the thread $x_{i}$ $(1<=x<=10^{9}+6)$ , and the color of the thread $c_{i}$ (). The red color is denoted by $0$ , and the black color is denoted by $1$ .

Print single integer the jelliness of the cobweb modulo $10^{9}+7$ . If there are no paths such that the numbers of red and black threads differ at most twice, print $1$ .