#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
vector<int> G[100100];
vector<int> cnt(100100, 1);
vector<bool> check(100100, 0);
ll dfs(int x) {
    check[x] = 1;
    for (int i = 0; i < G[x].size(); i++) {
        if (!check[G[x][i]]) {
            cnt[x] += dfs(G[x][i]);
        }
    }
    return cnt[x];
}
int main() {
    int n, q;
    cin >> n >> q;
    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);
    }
    dfs(0);
    ll ans = 0;
    for (int i = 0; i < q; i++) {
        int p;
        ll x;
        cin >> p >> x;
        p--;
        ans += x * cnt[p];
        cout << ans << endl;
    }
    return 0;
}