#pragma GCC optimize ("O3")

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <set>
#include <algorithm>
#include <numeric>
#include <list>
using namespace std;

using QWORD  = uint64_t;
using SQWORD = int64_t;
using DWORD  = uint32_t;
using SDWORD = int32_t;
using WORD   = uint16_t;
using SWORD  = int16_t;
using BYTE   = uint8_t;
using SBYTE  = int8_t;
using DOUBLE = double;
using FLOAT  = float;

#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)

#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)

#define MAX_QWORD  (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD  (0xFFFFFFFF)
#define MAX_WORD   (0xFFFF)
#define MAX_BYTE   (0xFF)

#define MAX_DOUBLE      (1.0e+308)
#define DOUBLE_EPS      (1.0e-12)
#define MIN_DOUBLE_N    (-1.0e+308)

#define ArrayLength(a)  (sizeof(a) / sizeof(a[0]))

static inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }

#define BYTE_BITS   (8)
#define WORD_BITS   (16)
#define DWORD_BITS  (32)
#define QWORD_BITS  (64)

static inline void inputStringSpSeparated(char *pcStr)
{
    char *pcCur = pcStr;
    for (;;) {
        char c = getchar();
        if (('\n' == c) || (EOF == c) || (' ' == c)) {
            break;
        }
        *pcCur = c;
        pcCur++;
    }
    *pcCur = '\0';
}

static inline void inputString(char *pcStr)
{
    char *pcCur = pcStr;
    for (;;) {
        char c = getchar();
        if (('\n' == c) || (EOF == c)) {
            break;
        }
        *pcCur = c;
        pcCur++;
    }
    *pcCur = '\0';
}


static inline SQWORD inputSQWORD(void)
{
    SQWORD sqNumber = 0;
    SQWORD sqMultiplier = 1;
    bool bRead = false;
    for (;;) {
        char c = getchar();
        if (!bRead) {
            if ('-' == c) {
                sqMultiplier = -1;
            }
        }
        if (('0' <= c) && (c <= '9')) {
            sqNumber *= 10LL;
            sqNumber += (SQWORD)(c - '0');
            bRead = true;
        } else {
            if (bRead) {
                return sqNumber * sqMultiplier;
            }
        }
    }
}


static inline SDWORD inputSDWORD(void)
{
    SDWORD lNumber = 0;
    SDWORD lMultiplier = 1;
    bool bRead = false;
    for (;;) {
        char c = getchar();
        if (!bRead) {
            if ('-' == c) {
                lMultiplier = -1;
            }
        }
        if (('0' <= c) && (c <= '9')) {
            lNumber *= 10;
            lNumber += (c - '0');
            bRead = true;
        } else {
            if (bRead) {
                return lNumber * lMultiplier;
            }
        }
    }
}

static inline DOUBLE inputFP(void)
{
    DOUBLE dInt = 0.0;
    DOUBLE dFrac = 0.0;
    DOUBLE dMultiplier = 1.0;
    DWORD dwFpCnt = 0;
    DOUBLE *pdCur = &dInt;
    bool bRead = false;
    for (;;) {
        char c = getchar();
        if (!bRead) {
            if ('-' == c) {
                dMultiplier = -1;
            }
        }
        if ('.' == c) {
            pdCur = &dFrac;
        } else if (('0' <= c) && (c <= '9')) {
            (*pdCur) *= 10;
            (*pdCur) += (DOUBLE)(c - '0');
            bRead = true;
            if (pdCur == &dFrac) {
                dwFpCnt++;
            }
        } else {
            if (bRead) {
                return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));
            }
        }
    }
}


/**
 *  mod による操作ライブラリ
 */

#define ANS_MOD (1000000007LL)
 
static SQWORD addMod(SQWORD x, SQWORD y)
{ 
    return (x + y) % ANS_MOD;
}
 
static SQWORD subMod(SQWORD x, SQWORD y)
{
    return (x - y + ANS_MOD) % ANS_MOD;
}
 
static SQWORD mulMod(SQWORD x, SQWORD y) 
{
    return (x * y) % ANS_MOD;
}
 
static SQWORD powMod(SQWORD x, SQWORD e) {
    SQWORD v = 1;
    for (; e; x = mulMod(x, x), e >>= 1) {
        if (e & 1) {
            v = mulMod(v, x);
        }
    }
    return v;
}
 
static SQWORD divMod(SQWORD x, SQWORD y)
{
    return mulMod(x, powMod(y, ANS_MOD - 2));
}
 
 
static SQWORD combMod(SQWORD n, SQWORD k)
{
    SQWORD v=1;
    for(SQWORD i=1; i<=k; i++) {
        v = divMod(mulMod(v, n-i+1),i);
    } 
    return v;
}

/*----------------------------------------------*/
/**
 *  遅延評価セグメント木
 */
struct SEGMENT_NODE_ST {
    SQWORD sqVal;     /* 値 (担当区間の最小値) */
    SQWORD sqLazy;    /* 遅延評価 (加算値)*/
    bool bLazyFlag;   /* 遅延評価フラグ */

public:
    void init(SQWORD sqInitVal) {
        sqVal = sqInitVal;
        sqLazy = 0;
        bLazyFlag = false;
    }
};

struct LazySegmentTree {
private:
    DWORD dwBaseSize;
    vector<SEGMENT_NODE_ST> vNode;

private:
    void debugPrint(void) {
        for (SQWORD sqIdx = 0; sqIdx < dwBaseSize * 2 - 1; sqIdx++) {
            printf("[%lld : v:%lld l:%lld] f[%d]\n", 
                sqIdx, vNode[sqIdx].sqVal, vNode[sqIdx].sqLazy, vNode[sqIdx].bLazyFlag);
        }
    }

    static inline SQWORD evaluateFunc(
        const SQWORD sqValL,
        const SQWORD sqValR)
    {
        return sqValL + sqValR;
    }

    static inline SQWORD getNodeVal(
        const SEGMENT_NODE_ST &stN)
    {
        if (stN.bLazyFlag) {
            return stN.sqVal + stN.sqLazy;
        } else {
            return stN.sqVal;          
        }
    }

    static inline void refreshLazyVal(
        SEGMENT_NODE_ST &stN)
    {
        stN.sqVal     += stN.sqLazy;
        stN.bLazyFlag = false;
        stN.sqLazy    = 0;
    }

    static inline void updateLazyVal(
        SEGMENT_NODE_ST &stN,
        SQWORD sqX)
    {
        stN.sqLazy += sqX;
        stN.bLazyFlag = true;
    }

    void initSegmentTree(
        vector<SQWORD> vsqInitVal)
    {
        /**
         *  最下段のノード数は元配列のサイズ以上になる最小の 2 冪 -> これを n とおく
         * セグメント木全体で必要なノード数は 2n-1 個である
         */
        DWORD dwSize = vsqInitVal.size();
        dwBaseSize = 1; 
        while (dwBaseSize < dwSize) {
            dwBaseSize *= 2;
        }
        vNode.resize(2 * dwBaseSize - 1);

        /**
         *  最下段に値を入れたあとに、下の段から順番に値を入れる
         * 値を入れるには、自分の子の 2 値を参照すれば良い
         */
        for(SDWORD lIdx = 0; lIdx < vsqInitVal.size(); lIdx++) {
            vNode[lIdx + (dwBaseSize - 1)].init(vsqInitVal[lIdx]);
        }
        for (SDWORD lIdx = dwBaseSize - 2; 0 <= lIdx; lIdx--) {
            vNode[lIdx].sqVal = evaluateFunc(vNode[lIdx*2+1].sqVal, vNode[lIdx*2+2].sqVal);
        }
    }

    void lazyEvaluate(int lNodeIdx, int lLeft, int lRight) {
        if (vNode[lNodeIdx].bLazyFlag) {
            if (lRight - lLeft > 1) {
                updateLazyVal(vNode[lNodeIdx*2+1], vNode[lNodeIdx].sqLazy);
                updateLazyVal(vNode[lNodeIdx*2+2], vNode[lNodeIdx].sqLazy);
            }
            refreshLazyVal(vNode[lNodeIdx]);
        }
    }

public:
    void UpdateValue(
        SDWORD lA, 
        SDWORD lB, 
        SDWORD lX,      /* update value */
        SDWORD lNodeIdx=0, SDWORD lLeft=0, SDWORD lRight=-1)    /* 自分のノードが対象とする区間 */
    {
        
        if (lRight < 0) {
            lRight = dwBaseSize;
        }

        if ((lRight <= lA) || (lB <= lLeft)) {
            return;
        }

        if ((lA <= lLeft) && (lRight <= lB)) {
            updateLazyVal(vNode[lNodeIdx], lX);
        } else {
            lazyEvaluate(lNodeIdx, lLeft, lRight);

            SDWORD lCenter = (lLeft + lRight) / 2;
            SDWORD lNodeIdx_L = (lNodeIdx * 2) + 1; 
            SDWORD lNodeIdx_R = (lNodeIdx * 2) + 2;
            UpdateValue(lA, lB, lX, lNodeIdx_L, lLeft, lCenter);
            UpdateValue(lA, lB, lX, lNodeIdx_R, lCenter, lRight);
            vNode[lNodeIdx].sqVal = evaluateFunc(getNodeVal(vNode[lNodeIdx_L]), 
                                                 getNodeVal(vNode[lNodeIdx_R]));
        }
    };

    SQWORD FindVal(
        SDWORD lA, 
        SDWORD lB, 
        SDWORD lNodeIdx=0, SDWORD lLeft=0, SDWORD lRight=-1)    /* 自分のノードが対象とする区間 */
    {
        if (lRight < 0) {
            lRight = dwBaseSize;
        }

        if ((lRight <= lA) || (lB <= lLeft)) {
            return 0;
        }

        if ((lA <= lLeft) && (lRight <= lB)) {
            return getNodeVal(vNode[lNodeIdx]);
        } else {
            lazyEvaluate(lNodeIdx, lLeft, lRight);
            SDWORD lCenter = (lLeft + lRight) / 2;
            SDWORD lNodeIdx_L = (lNodeIdx * 2) + 1; 
            SDWORD lNodeIdx_R = (lNodeIdx * 2) + 2;
            SQWORD sqValL = FindVal(lA, lB, lNodeIdx_L, lLeft, lCenter);
            SQWORD sqValR = FindVal(lA, lB, lNodeIdx_R, lCenter, lRight);
            return evaluateFunc(sqValL, sqValR);
        }
    };

    /* 元配列 v をセグメント木で表現する */
    LazySegmentTree(vector<SQWORD> init) {
        initSegmentTree(init);
    }
};


#define MAX_NODE    (200001)

struct TREE_NODE_INFO {
    SDWORD lDfsOrder;
    SDWORD lChildNum;
};
static TREE_NODE_INFO s_astTreeInfo[MAX_NODE + 1];

static void dfs(
    SDWORD lFrom, 
    SDWORD lCur, 
    const vector<SQWORD> *pVecEdge, 
    SDWORD &lOrder)
{
    SDWORD lRootDfsOrder = lOrder;
    s_astTreeInfo[lCur].lDfsOrder = lOrder;
    lOrder++;

    for (auto e: pVecEdge[lCur]) {
        if (e != lFrom) {
            dfs(lCur, e, pVecEdge, lOrder);
        }
    }

    s_astTreeInfo[lCur].lChildNum = lOrder - lRootDfsOrder;
}

int main(void)
{
    SQWORD sqN = inputSQWORD();
    SQWORD sqQ = inputSQWORD();

    static vector<SQWORD>   s_avecEdge[MAX_NODE + 1];

    for (SQWORD sqIdx = 0; sqIdx < sqN - 1; sqIdx++) {
        SQWORD sqA = inputSQWORD();
        SQWORD sqB = inputSQWORD();

        s_avecEdge[sqA].emplace_back(sqB);
        s_avecEdge[sqB].emplace_back(sqA);
    }

    /* dfsで順序を作る */
    SDWORD lOrder = 0;
    dfs(-1, 1, s_avecEdge, lOrder);

#if 0
    for (SDWORD lIdx = 1; lIdx <= sqN; lIdx++) {
        printf("%ld %ld %d\n", lIdx, s_astTreeInfo[lIdx].lDfsOrder, s_astTreeInfo[lIdx].lChildNum);
    }
#endif
    vector<SQWORD> vInitVal(sqN, 0);
    LazySegmentTree segTree(vInitVal);

    for (SQWORD sqQueryIdx = 0; sqQueryIdx < sqQ; sqQueryIdx++) {
        SQWORD sqP = inputSQWORD();
        SQWORD sqX = inputSQWORD();

        segTree.UpdateValue(s_astTreeInfo[sqP].lDfsOrder, 
                            s_astTreeInfo[sqP].lDfsOrder + s_astTreeInfo[sqP].lChildNum,
                            sqX);
    }

    for (SDWORD lNode = 1; lNode <= sqN; lNode++) {
        SQWORD sqVal = segTree.FindVal(s_astTreeInfo[lNode].lDfsOrder, s_astTreeInfo[lNode].lDfsOrder + 1);
        printf("%lld\n", sqVal);
    }

    return 0;
}

Measured memory_bytes: 37376