Problem:
Score : 400 points

Problem Statement

Given is a rooted tree with N vertices numbered 1 to N.
The root is Vertex 1, and the i-th edge (1 \leq i \leq N - 1) connects Vertex a_i and b_i.

Each of the vertices has a counter installed. Initially, the counters on all the vertices have the value 0.

Now, the following Q operations will be performed:

Operation j (1 \leq j \leq Q): Increment by x_j the counter on every vertex contained in the subtree rooted at Vertex p_j.

Find the value of the counter on each vertex after all operations.

Constraints

2 \leq N \leq 2 \times 10^5

1 \leq Q \leq 2 \times 10^5

1 \leq a_i < b_i \leq N

1 \leq p_j \leq N

1 \leq x_j \leq 10^4

The given graph is a tree.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N Q
a_1 b_1
:
a_{N-1} b_{N-1}
p_1 x_1
:
p_Q x_Q

Output

Print the values of the counters on Vertex 1, 2, \ldots, N after all operations, in this order, with spaces in between.

Sample Input 1

4 3
1 2
2 3
2 4
2 10
1 100
3 1

Sample Output 1

100 110 111 110

The tree in this input is as follows:

Each operation changes the values of the counters on the vertices as follows:

Operation 1: Increment by 10 the counter on every vertex contained in the subtree rooted at Vertex 2, that is, Vertex 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 0, 10, 10, 10, respectively.

Operation 2: Increment by 100 the counter on every vertex contained in the subtree rooted at Vertex 1, that is, Vertex 1, 2, 3, 4. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 110, 110, respectively.

Operation 3: Increment by 1 the counter on every vertex contained in the subtree rooted at Vertex 3, that is, Vertex 3. The values of the counters on Vertex 1, 2, 3, 4 are now 100, 110, 111, 110, respectively.

Sample Input 2

6 2
1 2
1 3
2 4
3 6
2 5
1 10
1 10

Sample Output 2

20 20 20 20 20 20

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

/*2019/08/25 */
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#define MOD 1000000007
#define MIN 999999999
#define MAX -999999999
typedef long long int ll;
typedef unsigned long long int ull;
void llswap(ll *x,ll *y){ll temp;temp=*x;*x=*y;*y=temp;}
void swap(int *x,int *y){int tmp;tmp=*x;*x=*y;*y=tmp;}
int rmax(int x,int y){return x>y?x:y;}
int rmin(int x,int y){return x>y?y:x;}
ll llrmax(ll x,ll y){return x>y?x:y;}
ll llrmin(ll x,ll y){return x>y?y:x;}
int asc(const void *a,const void *b){return *(int*)a-*(int*)b;}
int desc(const void *a,const void *b){return *(int*)b-*(int*)a;}
int llasc(const void *a,const void *b){return *(ll*)a-*(ll*)b;}
int lldesc(const void *a,const void *b){return *(ll*)b-*(ll*)a;}

typedef struct node_{
    int parent;
    int child;
    ll sum;
    int flg;
}node_t;
typedef struct query_{
    int p;
    int x;
}query_t;


int asc_t(const void *a,const void *b){return ((query_t*)a)->p - ((query_t*)b)->p;}
//int desc_t(const void *a,const void *b){return ((struct_t*)b)->member - ((struct_t*)a)->member;}


int main(){
    int n,q;
    static query_t query[500000];
    static int a[500000],b[500000];
    static node_t node[500000];
    static int list[500000];

    scanf("%d %d",&n,&q);
    for(int i=0;i<n;i++){
        node[i].sum=0;
        node[i].flg=0;
    }
    node[0].parent=-1;
    for(int i=0;i<n-1;i++){
        scanf("%d %d",&a[i],&b[i]);
        node[b[i]-1].parent=a[i];
        node[a[i]-1].child=b[i];
    }
    int query_n;
    for(query_n=0;query_n<q;query_n++){
        scanf("%d %d",&query[query_n].p,&query[query_n].x);
        list[query[query_n].p-1]=1;
    }
    for(int i=0;i<n;i++){
        if(list[i]!=1){
            query[query_n].p=i+1;
            query[query_n].x=0;
            query_n++;
        }
    }
    qsort(query,query_n,sizeof(query_t),asc_t);
    
    /*
    for(int i=0;i<q;i++){
        printf("%d %d\n",query[i].p,query[i].x);
    }
    */
    int num=1;
    for(int i=0;i<query_n;i++){
        if(node[query[i].p-1].flg==0&&query[i].p!=1){
            node[query[i].p-1].sum=node[node[query[i].p-1].parent-1].sum;
            node[query[i].p-1].flg=1;
        }
        node[query[i].p-1].sum+=query[i].x;
        node[node[query[i].p-1].child-1].sum=node[query[i].p-1].sum;
    }
    for(int i=0;i<n;i++){
        if(node[i].flg==0&&i!=0){
            node[i].sum=node[node[i].parent-1].sum;
            node[i].flg=1;
        }
    }
    for(int i=0;i<n;i++){
        printf("%lld ",node[i].sum);
    }
    printf("\n");
    return 0;
}