#include<bits/stdc++.h>
using namespace std;using ll=long long;using vi=vector<int>;using vvi=vector<vi>;using vl=vector<ll>;using vvl=vector<vl>;using P=pair<int,int>;using PL=pair<ll,ll>;using vp=vector<P>;using vpl=vector<PL>;
template<typename T>constexpr auto inf=numeric_limits<T>::max()/2;constexpr int INF=inf<int>,MOD=1000000007;constexpr ll LINF=inf<ll>;
#define _ol3(_1,_2,_3,name,...)name
#define _rep(i,n)_repi(i,0,n)
#define _repi(i,a,b)for(int i=a,i##_l=(b);i<i##_l;++i)
#define REP(...)_ol3(__VA_ARGS__,_repi,_rep,)(__VA_ARGS__)
#define REPR(i,n)for(int i=n-1;i>=0;--i)
#define REPA(i,v)REP(i,v.size())
#define all(v)(v).begin(),(v).end()
#define bit(n)(1ll<<(n))
#define uniq(v)sort(all(v));v.erase(unique(all(v)),v.end())
#define F first
#define S second
#define endl '\n'
#define cho(n,a,b)cout<<((n)?a:b)<<endl
void YES(int n){cho(n,"YES","NO");}void Yes(int n){cho(n,"Yes","No");}void Poss(int n){cho(n,"Possible","Impossible");}
void _print(ostream&s){}template<class T,class...U>void _print(ostream&s,T&&t,U&&...u){s<<t<<(sizeof...(u)?' ':'\n');_print(s,u...);}
template<class...T>void print(T&&...t){_print(cout,t...);}
#ifndef LOCAL
struct osd{template<class T>osd&operator<<(const T&t){return*this;}};osd cer_;
#define dprint(...)
#define cerr cer_
#else
template<class...T>void dprint(T&&...t){_print(cerr,t...);}
#endif
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>ostream&operator<<(ostream&o,const vector<T>&v){for(auto&&i:v)o<<i<<' ';return o;}
template<class T>istream&operator>>(istream&i,vector<T>&v){for(T&j:v)i>>j;return i;}
template<class T,class U>ostream&operator<<(ostream&o,const pair<T,U>&p){return o<<p.F<<' '<<p.S;}
template<class T,class U>istream&operator>>(istream&i,pair<T,U>&p){return i>>p.F>>p.S;}
template<class T>ostream&operator<<(ostream&o,const set<T>&v){for(auto&&i:v)o<<i<<' ';return o;}
template<class T>ostream&operator<<(ostream&o,const multiset<T>&v){for(auto&&i:v)o<<i<<' ';return o;}
template<class T>vector<T>&operator<<(vector<T>&v,const T&t){v.push_back(t);return v;}
template<class T>set<T>&operator<<(set<T>&v,const T&t){v.insert(t);return v;}
template<class T>multiset<T>&operator<<(multiset<T>&v,const T&t){v.insert(t);return v;}

int main(){
    cin.tie(0);ios::sync_with_stdio(0);
    int n,q;
    cin>>n>>q;
    vvi edge(n);
    REP(i,n-1){
        int a,b;
        cin>>a>>b;
        edge[a-1]<<b-1;
        edge[b-1]<<a-1;
    }
    //print("input1");
    vi mp(n,-1); // map tree to sequenced
    vi rt(n,-1); // root of the *chouten*
    vi sbtr(n,1); // subtree size
    {
        stack<int> que;
        que.push(0);
        int ptr=0;
        while(!que.empty()){
            int p=que.top();
            que.pop();
            dprint(p);
            if(p<0){ // get child size
                dprint("ptr:",ptr);
                p=-p-1;
                sbtr[mp[p]] = ptr - mp[p];
                continue;
            }
            mp[p]=ptr++;
            //int r=rt[p];
            que.push(-p-1);
            for(int b:edge[p]){
                if(b==rt[p])continue;
                que.push(b);
                rt[b]=p;
            }
        }
        dprint(mp);
        dprint(rt);

        dprint(sbtr);
    }
    //print("Yay");

    vi dif(n+1);
    REP(i,q){
        int p,x;
        cin>>p>>x;
        p--;
        dif[mp[p]]+=x;
        dif[mp[p]+sbtr[mp[p]]]-=x;
    }
    int c=0;
    dprint(dif);
    vi ans(n);
    REP(i,n){
        c+=dif[i];
        ans[i]=c;
    }
    REP(i,n){
        cout<<ans[mp[i]]<<' ';
    }
    cout<<endl;
    return 0;
}


Measured memory_bytes: 17908