暂无测试数据。

Description

You are given a tree rooted at node \(1\). You are tasked to perform the following \(2\) kinds of queries on it.

C x d - Adds \(d\) to all nodes in the subtree rooted at \(x\)
Q x - Queries \(\sum \sin(i)\) for all \(i\) in the subtree rooted at \(x\).