import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;
import std.container;

enum MAX = 1_000_100;
ulong MOD = 1_000_000_007;
ulong INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias Face = Tuple!(char, "dir", long, "num", bool, "edge");
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);

void main()
{
    long n, q;
    scan(n, q);
    auto tree = new long[][](n, 0);
    auto node = new long[](n);
    foreach (_; iota(n - 1))
    {
        long a, b;
        scan(a, b);
        a--, b--;
        tree[a] ~= b;
        tree[b] ~= a;
    }
    foreach (_; iota(q))
    {
        long p, x;
        scan(p, x);
        p--;
        node[p] += x;
    }
    auto stack = DList!(long)(0);
    bool[long] visited;
    visited[0] = true;
    while (!stack.empty)
    {
        auto current = stack.back;
        stack.removeBack();
        foreach (e; tree[current])
        {
            if (!(e in visited))
            {
                visited[e] = true;
                node[e] += node[current];
                stack.insertBack(e);
            }
        }
    }
    foreach (e; node)
        writef("%s ", e);
    writeln();
}

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}
