import std.stdio, std.conv, std.string, std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); }
void log()(){ writeln(""); } void log(T, A ...)(T t, lazy A a){ if(DEBUG) write(t, " "), log(a); } bool DEBUG = 0; 
string read(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
// ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- //

void solve(){
	int n = read.to!int;
	int q = read.to!int;
	
	Node[] nodes;
	foreach(i; 0 .. n) nodes ~= new Node(i);
	
	foreach(i; 0 .. n - 1){
		int a = read.to!int - 1;
		int b = read.to!int - 1;
		nodes[a].nodes ~= nodes[b];
		nodes[b].nodes ~= nodes[a];
	}
	
	nodes[0].treefy(null);
	
	foreach(t; 0 .. q){
		int p = read.to!int - 1;
		long x = read.to!long;
		nodes[p].value += x;
	}
	
	nodes[0].calc;
	
	nodes.map!(x => x.value.to!string).join(" ").writeln;
}

class Node{
	int id;
	long value;
	Node[] nodes;
	Node[] kids;
	Node parent;
	bool isTreefied;
	this(int id){
		this.id = id;
	}
	void treefy(Node par){
		this.isTreefied = 1;
		if(par) this.parent = par;
		foreach(nd; this.nodes){
			if(nd.isTreefied) continue;
			else{
				this.kids ~= nd;
				nd.treefy(this);
			}
		}
	}
	void calc(){
		foreach(kid; this.kids){
			kid.value += this.value;
			kid.calc;
		}
	}
}
