#include <iostream>
#include <array>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <math.h>
#include <string>
#include <climits>
#include <assert.h>
#include <iomanip>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <fstream>

#define FOR(i,a,n) for(int i=(a);i<(n); ++i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define IS_BIT_ON(bit, i) (bit & (1 << i))
#define BIT_ON(bit, i) (bit |= (1 << i))
#define BIT_OFF(bit, i) (bit &= ~(1 << i))
#define BIT_COUNT(bit) (__builtin_popcount(bit))

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail) != 0) {std::cout << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void print(std::vector<T> &v) {for (auto& a : v) { std::cout << a; if (&a != &v.back()) {std::cout << " ";} }std::cout << std::endl;}
template <class T> void print(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
void debug() { std::cerr << std::endl; }
template <class Head, class... Tail> void debug(Head&& head, Tail&&... tail) { std::cerr << head; if (sizeof...(tail) != 0) {std::cerr << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void debug(std::vector<T> &v) {for (auto& a : v) { std::cerr << a; if (&a != &v.back()) {std::cerr << " ";} }std::cerr << std::endl;}
template <class T> void debug(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }

template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}

long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

bool is_power_of_two(long long x) {
    return !(x & (x - 1));
}

long long gcd(long long a, long long b) {
    if (b == 0) { return a; }
    return gcd(b, a % b);
}

long long gcd(std::vector<long long> &v) {
    long long ans = v[0];
    for (int i = 1; i < (int)v.size(); ++i) {
        ans = gcd(ans, v[i]);
    }
    return ans;
}

long long lcm(long long a, long long b) {
    long long g = gcd(a, b);
    return a / g * b;
}

const int INF = 1u << 30u;
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

class Tree {
public:
    const int N;
    int root = -1;

    std::vector<std::vector<std::tuple<int, int>>> graph;
    std::vector<long long> value;

    std::vector<int> parent;
    std::vector<std::vector<int>> children;

    std::vector<int> depth;                 // rootからの深さ(距離ではない)
    std::vector<long long> cumulative_sum;  // uを部分木としたときのvalueの合計(uを含める)
    std::vector<int> num_node;              // uを部分木としたときのノードの数(uを含める)

    Tree(int n) : N(n) {
        this->graph.resize(N);
        this->value.resize(N);
    }

    void set_value(int u, int v) {
        this->value[u] = v;
    }

    void add_undirected_edge(int u, int v, long long weight) {
        this->graph[u].emplace_back(make_tuple(v, weight));
        this->graph[v].emplace_back(make_tuple(u, weight));
    }

    void add_directed_edge(int from, int to, long long weight) {
        this->graph[from].emplace_back(make_tuple(to, weight));
    }

    void build(const int r) {
        this->parent.clear(); this->parent.resize(N, 0);
        this->children.clear(); this->children.resize(N);

        this->depth.clear(); this->depth.resize(N, 0);
        this->cumulative_sum.clear(); this->cumulative_sum.resize(N, 0);
        this->num_node.clear(); this->num_node.resize(N, 0);

        this->root = r;
        this->parent[r] = -1;

        dfs(root, 0, -1);
    }

private:
    void dfs(int u, int d, int p) {
        this->parent[u] = p;
        this->depth[u] = d;
        this->cumulative_sum[u] = this->value[u];
        this->num_node[u] = 1;
        for (const auto &t : this->graph[u]) {
            int v;
            long long w;
            tie(v, w) = t;
            if (v != p) {
                dfs(v, d + 1, u);

                this->children[u].emplace_back(v);
                this->cumulative_sum[u] += this->cumulative_sum[v];
                this->num_node[u] += this->num_node[v];
            }
        }
    }
};

void dfs(int u, vector<LL> &dp, const Tree &tree) {

    FOE(v, tree.children[u]) {
        dp[v] += dp[u];
        dfs(v, dp, tree);
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    LL N, Q;
    cin >> N >> Q;

    Tree tree(N);
    FOR(i, 0, N - 1) {
        int A, B;
        cin >> A >> B;
        A--; B--;
        tree.add_undirected_edge(A, B, 0);
    }
    tree.build(0);

    auto dp = make_v<LL>(N);
    FOR(i, 0, Q) {
        int P, X;
        cin >> P >> X;
        P--;
        dp[P] += X;
    }

    dfs(0, dp, tree);

    print(dp);

    return 0;
}


Measured memory_bytes: 45440