Problem:
Score : 400 points

Problem Statement

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 installed. Initially, the counters on all the vertices have the value 0.

Now, the following Q operations will be performed:

Operation j (1 \leq j \leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.

Find the value of the counter on each vertex after all operations.

Constraints

2 \leq N \leq 2 \times 10^5

1 \leq Q \leq 2 \times 10^5

1 \leq a_i < b_i \leq N

1 \leq p_j \leq N

1 \leq x_j \leq 10^4

The given graph is a tree.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N Q
a_1 b_1
:
a_{N-1} b_{N-1}
p_1 x_1
:
p_Q x_Q

Output

Print the values of the counters on Vertex 1, 2, \ldots, N after all operations, in this order, with spaces in between.

Sample Input 1

4 3
1 2
2 3
2 4
2 10
1 100
3 1

Sample Output 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.

Sample Input 2

6 2
1 2
1 3
2 4
3 6
2 5
1 10
1 10

Sample Output 2

20 20 20 20 20 20

Solution in Kotlin (1.0.0) (judge verdict: Time Limit Exceeded)

import java.util.*
import java.io.PrintWriter



fun main(args: Array<String>){
	val cin = Scanner(System.`in`)
    val cout = PrintWriter(System.`out`)
    // val n = cin.nextInt()
    // val q = cin.nextInt()

    val (n, q) = readLine()!!.split(" ").map(String::toInt)

    val c = Array<MutableList<Int>>(n, { mutableListOf() })

    for (i in 0..n-2) {
        val (a, b) = readLine()!!.split(" ").map(String::toInt)
        c[a - 1].add(b - 1)
        c[b - 1].add(a - 1)
    }

    val has = Array<Int>(n, { 0 })
    for (i in 0..q-1) {
        // val p = cin.nextInt() - 1
        // val x = cin.nextInt()
        val (p, x) = readLine()!!.split(" ").map(String::toInt)
        has[p - 1] += x
    }

    val queue : MutableList<Int> = mutableListOf(0)

    while (queue.size > 0) {
        val r = queue.removeAt(0)
        for (child in c[r]) {
            if (c[child].size != 0) {
                has[child] += has[r]
                queue.add(child)
            }
        }
        c[r] = mutableListOf()
    }

    for (i in 0..n-1) {
        cout.println(has[i])
    }
    
    cout.flush()
}















class Point(x: Int, y: Int) : Comparable<Point> {
    val x = x
    val y = y
    
    override operator fun compareTo(other : Point) : Int {
        if (x > other.x) {
            return 1
        } else if (x < other.x) {
            return -1
        } else {
            if (y > other.y) {
                return 1
            } else if (y < other.y) {
                return -1
            } else {
                return 0
            }
        }
    }


    override fun equals(other : Any?) : Boolean {
        if (this == other) {
            return true
        }
        if (javaClass != other?.javaClass) {
            return false
        }
        other as Point
        if (x == other.x && y == other.y) {
            return true
        }
        return false
    }
}





inline fun <reified T, reified E> segTree(m: Int, noinline f: (T, T)->T, noinline g: (T, E)->T, noinline h:(E, E)->E, ti: T, ei: E, ini: Array<T>): SegTree<T, E> {
    val n = cover(m)
    val ini_tree = Array<T>(2*n - 1, { i ->
        if (i < m) {
            ini[i]
        } else {
            ti
        }
    })
    val lazy = Array<E>(2*n - 1, { ei })
    return SegTree(n, f, g, h, ti, ei, ini_tree, lazy)
}

fun cover(m: Int): Int {
    var n = 1
    while (n < m) {
        n *= 2
    }
    return n
}

fun cover_d(m: Int): Int {
    var d = 0
    var n = 1
    while (n < m) {
        n *= 2
        d += 1
    }
    return d
}

class SegTree<T, E> (n: Int, f: (T, T)->T, g: (T, E)->T, h: (E, E)->E, ti: T, ei: E, node: Array<T>, lazy: Array<E>) {
    val n = n
    val f = f
    val g = g
    val h = h
    val ti = ti
    val ei = ei
    val node = node
    val lazy = lazy
    val size = node.size
    val height = cover_d(n)

    fun trans(i: Int): Int {
        return i + n - 1
    }

    fun left(i: Int): Int {
        return 2*i + 1
    }

    fun right(i: Int): Int {
        return 2*i + 2
    }

    fun parent(i: Int): Int {
        if (i == 0) {
            return -1
        }
        return (i - 1)/2
    }

    fun ancestor(i: Int, d: Int): Int {
        return ((i + 1) shr d) - 1
    }

    fun isRight(i: Int): Boolean {
        return ((i and 1) == 0)
    }

    fun isLeaf(i: Int): Boolean {
        return (left(i) > size)
    }

    fun reflect(k: Int): T {
        if (k >= size) {
            return ti
        }
        if (lazy[k] == ei) {
            return node[k]
        }
        return g(node[k], lazy[k])
    }

    fun eval(k: Int) {
        if (lazy[k] == ei) {
            return
        }
        if (left(k) < size) {
            lazy[left(k)] = h(lazy[left(k)], lazy[k])
            lazy[right(k)] = h(lazy[right(k)], lazy[k])
        }
        node[k] = reflect(k)
        lazy[k] = ei
    }

    fun thrust(k: Int) {
        // if (k > 0) {
        //     thrust(parent(k))
        // }
        for (i in 0..height) {
            eval(ancestor(k, height - i))
        }
        // eval(k)
    }

    fun recalc(k: Int) {
        var i = parent(k)
        while (i >= 0) {
            node[i] = f(reflect(left(i)), reflect(right(i)))
            i = parent(i)
        }
    }

    fun update(a: Int, b: Int, x: E) {
        val l0 = trans(a)
        val r0 = trans(b)
        thrust(l0)
        thrust(r0 - 1)

        var l = l0
        var r = r0
        while (l < r) {
            if (isRight(l)) {
                lazy[l] = h(lazy[l], x)
                l += 1
            }
            if (isRight(r)) {
                r -= 1
                lazy[r] = h(lazy[r], x)
            }
            l = l shr 1
            r = r shr 1
        }
        recalc(l0)
        recalc(r0 - 1)
    }

    fun set_val(a: Int, x: T) {
        val ta = trans(a)
        thrust(ta)
        node[ta] = x
        lazy[ta] = ei
        recalc(ta)
    }

    fun query(a: Int, b: Int): T {
        var l = trans(a)
        var r = trans(b)
        thrust(l)
        thrust(r - 1)

        var vl = ti
        var vr = ti

        while (l < r) {
            if (isRight(l)) {
                vl = f(vl, reflect(l))
                l += 1
            }
            if (isRight(r)) {
                r -= 1
                vr = f(reflect(r), vr)
            }
        }
        
        return f(vl, vr)
    }
}