4 3 1 2 2 3 2 4 2 10 1 100 3 1
100 110 111 110 The tree in this input is as follows:  Each operation changes the values of the counters on the vertices as follows: * Operation $1$: Increment by $10$ the counter on every vertex contained in the subtree rooted at Vertex $2$, that is, Vertex $2, 3, 4$. The values of the counters on Vertex $1, 2, 3, 4$ are now $0, 10, 10, 10$, respectively. * Operation $2$: Increment by $100$ the counter on every vertex contained in the subtree rooted at Vertex $1$, that is, Vertex $1, 2, 3, 4$. The values of the counters on Vertex $1, 2, 3, 4$ are now $100, 110, 110, 110$, respectively. * Operation $3$: Increment by $1$ the counter on every vertex contained in the subtree rooted at Vertex $3$, that is, Vertex $3$. The values of the counters on Vertex $1, 2, 3, 4$ are now $100, 110, 111, 110$, respectively.
6 2 1 2 1 3 2 4 3 6 2 5 1 10 1 10
20 20 20 20 20 20
{
"problem": {
"name": "Ki",
"description": {
"content": "Given is a rooted tree with $N$ vertices numbered $1$ to $N$. The root is Vertex $1$, and the $i$\\-th edge $(1 \\leq i \\leq N - 1)$ connects Vertex $a_i$ and $b_i$. Each of the vertices has a counter i",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "abc138_d"
},
"statements": [
{
"statement_type": "Markdown",
"content": "Given is a rooted tree with $N$ vertices numbered $1$ to $N$. The root is Vertex $1$, and the $i$\\-th edge $(1 \\leq i \\leq N - 1)$ connects Vertex $a_i$ and $b_i$.\nEach of the vertices has a counter i...",
"is_translate": false,
"language": "English"
}
]
}