// Original C++ solution (slower):
/**

 *      purpose : 

 *      author  : kyomukyomupurin

 *      created : 

**/



// input/output

#include <iostream>

#include <fstream>

#include <sstream>

// container class

#include <array>

#include <deque>

#include <map>

#include <queue>

#include <set>

#include <stack>

#include <string>

#include <tuple>

#include <unordered_map>

#include <unordered_set>

#include <vector>

// math, algorithm

#include <algorithm>

#include <cmath>

#include <complex>

#include <numeric>

// etc

#include <bitset>

#include <cassert>

#include <cctype>

#include <cstring>

#include <chrono>

#include <functional>

#include <iomanip>

#include <random>

#include <utility>

// using-directive

using namespace std;

// alias template

using int64 = long long;

using uint64 = unsigned long long;

using vi = vector<int>;

using vl = vector<int64>;

using pii = pair<int, int>;

using pll = pair<int64, int64>;

// text macro replacement

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)

#define all(v) (v).begin(), (v).end()

#define rall(v) (v).rbegin(), (v).rend()

#define print(x) cout << (x) << '\n'

#define debug(x) cerr << #x << ": " << (x) << '\n'

#define dbg(v) for (size_t _ = 0; _ < v.size(); ++_){cerr << #v << "[" << _ << "] : " << v[_] << '\n';}

// variadic template

template<typename T> inline void chmin(T &a, T b) {if (a > b) a = b; return;}

template<typename T> inline void chmax(T &a, T b) {if (a < b) a = b; return;}

// constant

const int INF = (1<<30) - 1;

const int64 INF64 = (1LL<<62) - 1;

const int MOD = 1000000007;



vector<int> graph[202020];

vector<int> score(202020, 0);



void dfs(int cur, int prev) {

  score[cur] += score[prev];

  for (int next : graph[cur]) {

    if (next == prev) continue;

    dfs(next, cur);

  }

}



int main(){

  ios_base::sync_with_stdio(false);

  cin.tie(nullptr);



  int n, q; cin >> n >> q;

  for (int i = 0; i < n - 1; ++i) {

    int a, b; cin >> a >> b;

    graph[a].emplace_back(b);

    graph[b].emplace_back(a);

  }



  for (int i = 0; i < q; ++i) {

    int p, x; cin >> p >> x;

    score[p] += x;

  }



  dfs(1, 0);



  for (int i = 1; i <= n; ++i) {

    cout << score[i] << " ";

  }



  return 0;

}

// Optimized solution to the same problem (faster):
/**

 *    author  : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏

 *    created : 2020-03-11 21:32:37

**/



#include <iostream>

#include <deque>

#include <map>

#include <queue>

#include <set>

#include <stack>

#include <string>

#include <vector>

#include <algorithm>

#include <cmath>

#include <complex>

#include <numeric>

#include <bitset>

#include <cassert>

#include <cctype>

#include <iomanip>

#include <random>

#include <utility>

#include <chrono>



using namespace std;



using int64 = long long;



template<class T> using binary_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;

template<class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) { os << '{'; size_t n = vec.size(); for (size_t i = 0; i < n; ++i) { os << vec[i]; if (i != n - 1) os << ','; } os << '}'; return os; }

template<class T, class U> std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) { return os << '{' << p.first << " " << p.second << '}'; }

template<class T, class U> std::ostream& operator<<(std::ostream& os, const std::map<T, U>& mp) { os << '{'; for (auto it = mp.begin(); it != mp.end(); ++it) { os << '{' << it->first << ':' << it->second << '}'; if (it != --mp.end()) os << ','; } os << '}'; return os; }

template<class T> std::ostream& operator<<(std::ostream& os, const std::set<T>& st) { os << '{'; for (auto it = st.begin(); it != st.end(); ++it) { os << *it; if (it != --st.end()) os << ','; } os << '}'; return os; }

template<class T> std::istream& operator>>(std::istream& is, std::vector<T>& vec) { size_t n = vec.size(); for (size_t i = 0; i < n; ++i) is >> vec[i]; return is; }



#define all(_) begin(_), end(_)

#define rall(_) rbegin(_), rend(_)



#ifdef LOCAL

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)

#else

#define debug(...) 1728

#endif



void debug_out() { std::cerr << '\n'; }



template <class Head, class... Tail>

void debug_out(Head&& head, Tail&&... tail) {

  std::cerr << head;

  if (sizeof...(Tail) != 0) std::cerr << ", ";

  debug_out(std::forward<Tail>(tail)...);

}



using graph = std::vector<std::vector<int>>;



int main() {

  ios_base::sync_with_stdio(false);

  cin.tie(nullptr);



  int n, q; cin >> n >> q;

  graph g(n);

  for (int i = 0; i < n - 1; ++i) {

    int a, b; cin >> a >> b;

    --a; --b;

    g[a].emplace_back(b);

    g[b].emplace_back(a);

  }



  vector<int> counter(n, 0);



  for (int i = 0; i < q; ++i) {

    int p, x; cin >> p >> x; --p;

    counter[p] += x;

  }



  auto dfs = [&](const auto& dfs, int cur, int prev) -> void {

    for (int next : g[cur]) {

      if (next == prev) continue;

      counter[next] += counter[cur];

      dfs(dfs, next, cur);

    }

  };



  dfs(dfs, 0, -1);



  for (int i = 0; i < n; ++i) {

    cout << counter[i] << " ";

  }



  return 0;

}

// Fastest known solution for this problem: