#include <bits/stdc++.h>
using namespace std;

#define int long long

const int N=2e5+5;

vector <int> g[N];
int sz[N], fa[N], dep[N], son[N];

void dfs1(int x)
{
	sz[x]=1;
	for(auto to:g[x])
		if(to!=fa[x])
		{
			fa[to]=x;
			dep[to]=dep[x]+1;
			dfs1(to);
			sz[x] += sz[to];
			if(sz[to]>sz[son[x]])
				son[x]=to;
		}
}

int top[N], dfsn[N], point[N], Indx;

void dfs2(int x,int t)
{
	top[x]=t, dfsn[x]=++Indx, point[Indx]=x;
	if(son[x])
		dfs2(son[x],t);

	for(auto to:g[x])
		if(to!=fa[x] && to!=son[x])
			dfs2(to,to);
}

int lca(int x,int y)
{
	while(top[x]!=top[y])
	{
		if(dep[top[x]]<dep[top[y]])
			swap(x,y);

		x=fa[top[x]];
	}

	if(dep[x]<dep[y])
		return x;
	return y;
}

struct node
{
	int x,y,c;
};

vector <node> vec[N];
int p[N], sum[N], ans[N], tot[N], out[N], alltot;
map <pair<int,int>,int> Edge;

int getfa(int x)
{
	if(x!=p[x])
		p[x]=getfa(p[x]);
	return p[x];
}

void merge(int x,int y)
{
	int fax=getfa(x), fay=getfa(y);
	p[fax]=fay;
}

void dfs3(int x)
{
	for(auto to:g[x])
		if(to!=fa[x])
		{
			dfs3(to);
			sum[x] += sum[to];
			tot[x] += tot[to];
		}

	Edge.clear();
	for(auto p:vec[x])
	{
		sum[x] += p.c;
		if(p.x==x || p.y==x)
			sum[getfa(p.x+p.y-x)] += p.c;
		else
		{
			out[getfa(p.x)] += p.c;
			out[getfa(p.y)] += p.c;
			Edge[make_pair(min(getfa(p.x),getfa(p.y)),max(getfa(p.x),getfa(p.y)))] += p.c;
		}
	}

	vector <int> val;
	for(auto to:g[x])
		if(to!=fa[x])
			val.push_back(sum[to]);

	sort(val.begin(),val.end(),greater<int>());

	if(val.size()>=2)
		ans[x]=max(ans[x],val[0]+val[1]);
	else if(val.size())
		ans[x]=max(ans[x],val[0]);

	for(auto p:Edge)
		ans[x]=max(ans[x],sum[p.first.first]+sum[p.first.second]+p.second);

	vector<int> son;
	for(auto to:g[x])
		if(to!=fa[x])
			son.push_back(to);

	if(!son.size())
		ans[x]=alltot;
	else
	{
		for(auto to:son)
		{
			int val=alltot;
			for(auto oth:son)
				if(oth!=to)
					val -= tot[oth];
			val += sum[x]-sum[to]-out[to];
			ans[x]=max(ans[x],val);
		}
	}

	for(auto to:g[x])
		if(to!=fa[x])
			merge(to,x);
}

signed main()
{
	int n,k;
	cin >> n >> k;
	for(int i=1;i<n;i++)
	{
		int x,y;
		scanf("%lld %lld",&x,&y);
		g[x].push_back(y);
		g[y].push_back(x);
	}

	dep[1]=1;
	dfs1(1);
	dfs2(1,1);

	for(int i=1;i<=k;i++)
	{
		int a,b,c;
		scanf("%lld %lld %lld",&a,&b,&c);
		alltot += c;
		if(a==b)
			assert(0);

		tot[a] += c, tot[b] += c;
		vec[lca(a,b)].push_back((node){a,b,c});
	}

	for(int i=1;i<=n;i++)
		p[i]=i;

	dfs3(1);

	for(int i=1;i<=n;i++)
		printf("%lld ",ans[i]);
	return 0;
}