#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "YES" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "NO" << endl;  \
    }
#define IFYes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "Yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "No" << endl;  \
    }
#define IFyes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "no" << endl;  \
    }
#define DEBUG_OUTPUT_ARRAY(XXX, ONE)                            \
    for (int i = 0; i < (ONE); i++)                             \
    {                                                           \
        cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
    }
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO)                             \
    for (int i = 0; i < (ONE); i++)                                    \
    {                                                                  \
        cout << "<<< i = " << i << " >>>" << endl;                     \
        for (int j = 0; j < (TWO); j++)                                \
        {                                                              \
            cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
        }                                                              \
    }
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
    for (int i = 0; i < (ONE); i++)            \
    {                                          \
        cout << i << "  ";                     \
        for (int j = 0; j < (TWO); j++)        \
        {                                      \
            cout << XXX[i][j] << " ";          \
        }                                      \
        cout << endl;                          \
    }

typedef pair<long long int, long long int> pll;


const long long int mod = 1000000007;
const long long int INF = 99999999999999999;

long long int N,Q,res[200005]={};
pll ab[200005];
vector<long long int> edge[200005];
stack<long long int>sta;
string str[55];
bool used[200005]={};
long long int dfs(long long int id,long long int cost){
    
	used[id]=true;
    for(int i=0;i<edge[id].size();i++){
        if(!used[edge[id][i]])dfs(edge[id][i],res[id]+cost);
    }
    res[id]+=cost;
}
int main()
{
    cout << fixed << setprecision(18);
    cin>>N>>Q;
    for(int i=0;i<N-1;i++){
        cin>>ab[i].first>>ab[i].second;
        ab[i].first--;
        ab[i].second--;
        edge[ab[i].first].push_back(ab[i].second);
		
        edge[ab[i].second].push_back(ab[i].first);
    }
    for(int i=0;i<Q;i++){
        cin>>ab[i].first>>ab[i].second;
        ab[i].first--;
        res[ab[i].first]+=ab[i].second;
    }
	dfs(0,0);
    for(int i=0;i<N;i++){
        cout<<res[i]<<endl;
    }
}



Measured memory_bytes: 27648