/*
ID: computerbox --> Huseyn Hajiyev
LANG: C++
TASK: target_mode_on
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define _CRT_SECURE_NO_WARNINGS
//#include <boost/multiprecision/cpp_int.hpp>
//using boost::multiprecision::cpp_int;
#define FAST_READ ios_base::sync_with_stdio(0);
#define in freopen("input.txt", "r", stdin);
#define out freopen("output.txt", "w", stdout);
#define ll long long
#define debt(x,y)cout<<"#x = "<<(x)<<" and "<<"#y = "<<(y)<<endl;
#define deb(x)cout<<"#x = "<<(x)<<endl;
#define COUT(n, a) cout<< fixed << setprecision(a) << n<<endl
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define endl "\n"
#define arr(a,n) for(ll i=1;i<=n;i++) cout<<a[i]<<" "; cout << "\n";
#define vecc(a,n) for(ll i=0;i<n;i++) cout<<a[i]<<" "; cout << "\n";
#define CURTIME() cerr << clock() * 1.0 / CLOCKS_PER_SEC << endl
#define DTIME(ccc) __begin = clock(); ccc; cerr<<"Time of work = "<<(clock()-__begin)/CLOCKS_PER_SEC<<endl;
#define MAXN 2000
//cin.ignore (7777, '\n');

using namespace std;
using namespace __gnu_pbds;

#define debug(args...)(Debugger()) , args
class Debugger
{
  public:
  Debugger(const std::string& _separator=", ") :
  first(true),separator(_separator){}
  template<typename ObjectType>
  Debugger& operator,(const ObjectType& v)
  {
        if(!first)cerr<<separator;
        cerr<<v;
        first=false;
        return *this;
  }
  ~Debugger() {cerr<<endl;}      
  private:
    bool first;
    string separator;
};
 
template <typename T1, typename T2>
inline ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& p)
{
   return os<<"("<<p.first<<", "<<p.second<<")";
}
template<typename T>
inline ostream &operator<<(ostream & os,const vector<T>& v)
{
    bool first=true;
    os<<"[";
    for(unsigned ll i=0;i<v.size();i++)
    {
        if(!first)os<<", ";
        os<<v[i];
        first=false;
    }
        return os<<"]";
}
template<typename T>
inline ostream &operator<<(ostream & os,const set<T>&v)
{
    bool first=true;
    os<<"[";
    for(typename set<T>::const_iterator ii=v.begin();ii!=v.end();++ii)
    {
        if(!first)os<<", ";
        os<<*ii;
        first=false;
    }
    return os<<"]";
}
template<typename T1, typename T2>
inline ostream &operator<<(ostream & os,const map<T1, T2>&v)
{
        bool first=true;
        os<<"[";
        for(typename map<T1,T2>::const_iterator ii=v.begin(); ii!=v.end();++ii)
        {
            if(!first)os<<", ";
            os<<*ii;
            first=false;
        }
        return os<<"]";
}

vector<ll>order;
ll used[200010];
vector<ll>adj[200010];

struct s
{
  ll nac,konec;	
};

s nuj[200010];

void dfs(ll v)
{
  used[v]=1;
  nuj[v].nac=(ll)order.size();
  order.pb(v);
  for(auto to:adj[v])
  {
	if(!used[to])dfs(to);  
  }
  nuj[v].konec=(ll)order.size();
}

ll tadd[4*200010];
ll t[4*200010];

void push(ll v,ll l,ll r)
{
  if(tadd[v]!=0)
  {
    t[v]+=(r-l+1)*tadd[v];
    if(l!=r)
    {
	 tadd[v*2]+=tadd[v];
	 tadd[v*2+1]+=tadd[v];	
    }
    tadd[v]=0;	
  }
}

void update(ll v,ll l,ll r,ll nac,ll konec,ll x)
{ 
  push(v,l,r);
  if(l>konec || r<nac)return ;
  if(l>=nac && r<=konec)
  {
	tadd[v]+=x;
	push(v,l,r); 
	return ; 
  }
  ll mid=l+(r-l)/2;
  update(v*2,l,mid,nac,konec,x);
  update(v*2+1,mid+1,r,nac,konec,x);
  t[v]=t[v*2]+t[v*2+1];
}

ll ans[200010];

ll query(ll v,ll l,ll r,ll nac,ll konec)
{
  push(v,l,r);
  if(l>konec || r<nac)return 0;
  if(l>=nac && r<=konec)return t[v];
  ll mid=l+(r-l)/2;
  ll one=query(v*2,l,mid,nac,konec);
  ll two=query(v*2+1,mid+1,r,nac,konec);
  return one+two;	
}
ll n,m;
int main(){
FAST_READ;
cin>>n>>m;
for(ll i=1;i<n;i++)
{
  ll x,y;
  cin>>x>>y;
  adj[x].pb(y);
  adj[y].pb(x);	
}
dfs(1);
while(m--)
{
  ll x,y; 
  cin>>x>>y;
  ll nac=nuj[x].nac+1;
  ll konec=nuj[x].konec;
  update(1,1,n,nac,konec,y);	
}

for(ll i=1;i<=n;i++)
{
  ans[order[i-1]]=query(1,1,n,i,i);	
}
arr(ans,n);

return 0;
} 


Measured memory_bytes: 43124