fn dfs(
    pos: usize,
    pre: Option<usize>,
    idx: &mut usize,
    indices: &mut Vec<usize>,
    last_indices: &mut Vec<usize>,
    edges: &Vec<Vec<usize>>,
) {
    indices[pos] = *idx;
    *idx += 1;
    for nxt in edges[pos].iter() {
        if let Some(p) = pre {
            if *nxt == p {
                continue;
            }
        }
        dfs(*nxt, Some(pos), idx, indices, last_indices, edges);
    }
    last_indices[pos] = *idx;
}

fn solve() {
    let s = std::io::stdin();
    let mut sc = Scanner { stdin: s.lock() };
    let n: usize = sc.read();
    let q: usize = sc.read();
    let mut edges = vec![vec![]; n];
    for _ in 0..n-1 {
        let a: usize = sc.read();
        let b: usize = sc.read();
        edges[a - 1].push(b - 1);
        edges[b - 1].push(a - 1);
    }
    let mut idx = 0;
    let mut indices = vec![0; n];
    let mut last_indices = vec![0; n];
    let mut counters: Vec<i64> = vec![0; n + 1];
    dfs(0, None, &mut idx, &mut indices, &mut last_indices, &edges);
    for _ in 0..q {
        let p: usize = sc.read();
        let x: i64 = sc.read();
        let src = indices[p - 1];
        let last = last_indices[p - 1];
        counters[src] += x;
        counters[last] -= x;
    }
    for i in 0..n {
        counters[i+ 1] += counters[i];
    }
    for i in 0..n {
        let idx = indices[i];
        print!("{} ", counters[idx]);
    }
}

fn main() {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024) // 64MB
        .spawn(|| solve())
        .unwrap()
        .join()
        .unwrap();
}
pub mod utils {
    const DYX: [(isize, isize); 8] = [
        (0, 1),   //right
        (1, 0),   //down
        (0, -1),  //left
        (-1, 0),  //top
        (1, 1),   //down right
        (-1, 1),  //top right
        (1, -1),  //down left
        (-1, -1), //top left
    ];

    pub fn try_adj(y: usize, x: usize, dir: usize, h: usize, w: usize) -> Option<(usize, usize)> {
        let ny = y as isize + DYX[dir].0;
        let nx = x as isize + DYX[dir].1;
        if ny >= 0 && nx >= 0 {
            let ny = ny as usize;
            let nx = nx as usize;
            if ny < h && nx < w {
                Some((ny, nx))
            } else {
                None
            }
        } else {
            None
        }
    }
}

//snippet from kenkoooo
pub struct Scanner<R> {
    stdin: R,
}

impl<R: std::io::Read> Scanner<R> {
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn read_line(&mut self) -> String {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b'\n' || b == b'\r')
            .take_while(|&b| b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }

    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}


Measured memory_bytes: 47484