import java.io.PrintWriter
import java.util.*
import java.math.*
import java.lang.*
import kotlin.comparisons.*

val pw = PrintWriter(System.out)
val MOD: Long = (1e+9 + 7).toLong()

data class Order(val p: Int, val x: Int)
fun main(args: Array<String>) {

    val (n, q) = readListOfInt()

    val nodeOfEdges = (0 .. n).map { mutableListOf<Int>() }.toMutableList()
    for(i in 0 until n-1) {
        val ab = readListOfInt().sorted()
        nodeOfEdges[ab[0]].add(ab[1])
    }

    val orders = (0 until q).map {
        val (p, x) = readListOfInt()
        Order(p, x)
    }

    val myScores = (0 .. n).map { 0L }.toMutableList()
    val givenScores = (0 .. n).map { 0L }.toMutableList()

    orders.forEach { order ->
        myScores[order.p] = myScores[order.p] + order.x
    }

    for(i in 1 .. n) {
        givenScores[i] = givenScores[i] + myScores[i]
        val pScore = givenScores[i]
        val edges = nodeOfEdges[i]
        edges.forEach { edge ->
            givenScores[edge] += givenScores[edge] + pScore
        }
        //println("$i, $pScore, $edges")
        //println("givenScores: $givenScores")
    }
    //println("$n, $q")
    //println(nodeOfEdges)
    //println(myScores)
    //println(givenScores)
    //println(orders)
    for(i in 1 until n) {
        print("${givenScores[i]} ")
    }
    print("${givenScores[n]}\n")
    
    pw.flush()
}

/****** Declared Functions and Data Structures ******/
// IO
fun read() = readLine()!!
fun readInt() = read().toInt()
fun readLong() = read().toLong()
fun readDouble() = read().toDouble()
fun readListOfString() = read().split(" ")
fun readListOfInt() = readListOfString().map { it.toInt() }
fun readListOfLong() = readListOfString().map { it.toLong() }
fun readListOfDouble() = readListOfString().map { it.toDouble() }

fun Double.format(digits: Int) = String.format("%.${digits}f", this)
fun Float.format(digits: Int) = String.format("%.${digits}f", this)

fun print(value: Any) { pw.print(value) }
fun println(value : Any) { pw.println(value) }

fun<T> permutations(src: List<T>): List<List<T>> {
    if(src.size == 1) return listOf(src)
    val perms = mutableListOf<List<T>>()
    val insertElement = src[0]
    permutations(src.drop(1)).forEach { perm ->
        for(i in 0..perm.size) {
            val newPerm = perm.toMutableList()
            newPerm.add(i, insertElement)
            perms.add(newPerm.toList())
        }
    }
    return perms
}

// return nCr, if you want nCr, please access v[n][r]
fun combinations(n: Long): List<List<Long>> {
    val v = (0..n).map { (0..n).map{0L}.toMutableList() }.toMutableList()
    for(i in 0 until v.size) {
        v[i][0] = 1L
        v[i][i] = 1L
    }
    for(i in 0 until v.size) {
        for(j in 1 until i) {
            v[i][j] = (v[i-1][j-1] + v[i-1][j]) % MOD
        }
    }
    return v.map { it.toList() }.toList()
}

// should be a >= b
fun gcd(a: Long, b: Long): Long = 
    if(b == 0L) a else gcd(b, a % b)

// shoud be a >= b
fun lcm(a: Long, b: Long): Long = 
    a / gcd(a, b) * b

fun sumDigits(num_: Long): Long {
    var num = num_
    var rtn: Long = 0
    while(num != 0.toLong()) {
        val tmp = num % 10
        rtn += tmp
        num /= 10
    }
    return rtn
}

fun isDecimal(v: Double): Boolean = ((v - Math.floor(v)) != 0.0)

// Data Structures
class Stack<T>(private var st: MutableList<T> = mutableListOf<T>()) {
    fun isEmpty() = st.isEmpty()
    fun top(): T = st.last()
    fun push(e: T) { st.add(e) }
    fun pop() { st = st.dropLast(1).toMutableList() }
}

class Queue<T>(private var que: MutableList<T> = mutableListOf<T>()) {
    fun isEmpty() = que.isEmpty()
    fun top(): T = que.first()
    fun push(e: T) { que.add(e) }
    fun pop() { que = que.drop(1).toMutableList() }
}


Measured memory_bytes: 150756