#include <iostream>
#include <vector>
#include <unordered_map>
#include <stack>
 
using namespace std;
 
struct Employee {
    int id;
    int initialBalance;
    int finalBalance;
    vector<int> subordinates;
};
 
unordered_map<int, Employee> employees;
 
void distributeBonuses(int teamLeader, int bonus) {
    Employee& leader = employees[teamLeader];
    leader.finalBalance += bonus * 2;
 
    for (int subordinate : leader.subordinates) {
        Employee& emp = employees[subordinate];
        emp.finalBalance += bonus;
    }
}
 
void dfs(int root) {
    stack<int> stk;
    stk.push(root);
 
    while (!stk.empty()) {
        int empId = stk.top();
        stk.pop();
 
        Employee& emp = employees[empId];
 
        for (int subordinate : emp.subordinates) {
            stk.push(subordinate);
            emp.finalBalance += employees[subordinate].finalBalance;
        }
    }
}
 
int main() {
    int t;
    cin >> t;
 
    while (t--) {
        int n, q;
        cin >> n >> q;
 
        employees.clear();
 
        for (int i = 1; i <= n; i++) {
            int initialBalance;
            cin >> initialBalance;
            employees[i] = {i, initialBalance, 0, {}};
        }
 
        for (int i = 0; i < n - 1; i++) {
            int a, b;
            cin >> a >> b;
            employees[a].subordinates.push_back(b);
        }
 
        for (int i = 0; i < q; i++) {
            int leader, bonus;
            cin >> leader >> bonus;
            distributeBonuses(leader, bonus);
        }
 
        dfs(1); // Start DFS from the head of the company
 
        for (int i = 1; i <= n; i++) {
            cout << employees[i].finalBalance << " ";
        }
        cout << endl;
    }
 
    return 0;
}