Chef and Tree

Chef has a tree on N nodes. Each node v has an integer label Cv attached to it. Chef also has two other integers, A and B. He needs to run Q queries on the tree, each of which can be one of the following two types: - 1 u v w — add w to the labels of all vertices which lie on a simple path between nodes u and v. - 2 u v — find the number of vertices x on a simple path between u and v for which A*C