/**
 *    author:  ytsmash
 *    created: 15.08.2021 10:24:54
 **/

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) x.begin(), x.end()
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
using P = pair<int, int>;

vector<vector<ll>> d;
vector<ll> cnt;
vector<ll> B;

void f(int i) {
    B[i] = 1;
    for (ll j : d[i]) {
        if (B[j] == 0) {
            f(j);
            cnt[i] += cnt[j];
        }
    }
    return;
}

int main() {
    ll N, Q, a, b, ans = 0, p, x;
    cin >> N >> Q;
    d.resize(N);
    cnt.resize(N);
    B.resize(N);
    for (int i = 0; i < N - 1; i++) {
        cnt[i] = 1;  // 頂点p[i]を根とする部分木に含まれる頂点の数
        cin >> a >> b;
        d[a - 1].push_back(b - 1);
        d[b - 1].push_back(a - 1);
    }
    cnt[N - 1] = 1;
    f(0);
    rep(i, Q) {
        cin >> p >> x;
        ans += cnt[p - 1] * x;
        cout << ans << "\n";
    }
}