#include <stdio.h>
#include <stdlib.h>
 
#define MAXN 500000
 
typedef struct Node {
    int employee;
    struct Node* next;
} Node;
 
typedef struct {
    Node* head;
} List;
 
List adjList[MAXN + 1];
int initialBalance[MAXN + 1];
int finalBalance[MAXN + 1];
int subordinates[MAXN + 1];
 
void addEdge(int u, int v) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->employee = v;
    newNode->next = adjList[u].head;
    adjList[u].head = newNode;
}
 
void dfs(int node, int parent) {
    subordinates[node] = 1;
    Node* temp = adjList[node].head;
    while (temp) {
        int child = temp->employee;
        if (child != parent) {
            dfs(child, node);
            subordinates[node] += subordinates[child];
        }
        temp = temp->next;
    }
}
 
void distributeBonuses(int node, int bonus) {
    finalBalance[node] += bonus;
    Node* temp = adjList[node].head;
    while (temp) {
        int child = temp->employee;
        distributeBonuses(child, bonus);
        temp = temp->next;
    }
}
 
void clearGraph(int n) {
    for (int i = 1; i <= n; i++) {
        Node* temp = adjList[i].head;
        while (temp) {
            Node* toDelete = temp;
            temp = temp->next;
            free(toDelete);
        }
        adjList[i].head = NULL;
    }
}
 
int main() {
    int T;
    scanf("%d", &T);
 
    while (T--) {
        int N, Q;
        scanf("%d %d", &N, &Q);
 
        for (int i = 1; i <= N; i++) {
            scanf("%d", &initialBalance[i]);
            finalBalance[i] = initialBalance[i];
            adjList[i].head = NULL;
            subordinates[i] = 0;
        }
 
        for (int i = 0; i < N - 1; i++) {
            int A, B;
            scanf("%d %d", &A, &B);
            addEdge(A, B);
        }
 
        dfs(1, -1); // Calculate subordinates
 
        for (int i = 0; i < Q; i++) {
            int X, Y;
            scanf("%d %d", &X, &Y);
            finalBalance[X] += 2 * Y; // Team leader gets double bonus
            distributeBonuses(X, Y);
        }
 
        for (int i = 1; i <= N; i++) {
            printf("%d ", finalBalance[i]);
        }
        printf("\n");
 
        clearGraph(N); // Clear graph for the next test case
    }
 
    return 0;
}