#pragma region Macros #include #define rep(i, n) for(int(i) = 0; (i) < (n); (i)++) #define rrep(i, n) for(int(i) = (n)-1; (i) >= 0; (i)--) #define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++) #define ROF(i, m, n) for(int(i) = (n)-1; (i) >= (m); (i)--) #define ALL(v) (v).begin(), (v).end() #define LLA(v) (v).rbegin(), (v).rend() #define SZ(v) (int)(v).size() #define INT(...) \ int __VA_ARGS__; \ read(__VA_ARGS__) #define LL(...) \ ll __VA_ARGS__; \ read(__VA_ARGS__) #define DOUBLE(...) \ double __VA_ARGS__; \ read(__VA_ARGS__) #define CHAR(...) \ char __VA_ARGS__; \ read(__VA_ARGS__) #define STRING(...) \ string __VA_ARGS__; \ read(__VA_ARGS__) #define VEC(type, name, size) \ vector name(size); \ read(name) #define VEC2(type, name, height, width) \ vector> name(height, vector(width)); \ read(name) #define DVEC(type, name1, name2, size) \ vector name1(size), name2(size); \ read(name1, name2) #define TVEC(type, name1, name2, name3, size) \ vector name1(size), name2(size), name3(size); \ read(name1, name2, name3) using namespace std; using ll = long long; using pii = pair; using pll = pair; const int INF = 1 << 30; const ll LINF = 1LL << 60; const int MOD = 1e9 + 7; const char newl = '\n'; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1}; template inline bool between(T x, T l, T r) { return l <= x && x < r; } template inline vector make_vec(size_t a, T val) { return vector(a, val); } template inline auto make_vec(size_t a, Ts... ts) { return vector(a, make_vec(ts...)); } void read() {} template inline void read(T &a) { cin >> a; } template inline void read(pair &p) { read(p.first), read(p.second); } template inline void read(vector &v) { for(auto &&a : v) read(a); } template inline void read(vector &a, vector &b) { for(int i = 0; i < a.size(); i++) { read(a[i]); read(b[i]); } } template inline void read(vector &a, vector &b, vector &c) { for(int i = 0; i < a.size(); i++) { read(a[i]); read(b[i]); read(c[i]); } } template inline void read(Head &head, Tail &...tail) { read(head), read(tail...); } template void _write(const T &a) { cout << a; } template void _write(const std::pair &a) { cout << a.first << ' ' << a.second; } template void write(const T &a) { _write(a); cout << newl; } template void write(const vector &a) { for(int i = 0; i < a.size(); i++) { _write(a[i]); cout << (i + 1 == a.size() ? newl : ' '); } } template void write(const Head &head, const Tail &...tail) { _write(head); cout << ' '; write(tail...); } template void writel(const T &a) { cout << a << '\n'; } template void writel(const vector &a) { for(int i = 0; i < a.size(); i++) { _write(a[i]); cout << newl; } } template void writel(const Head &head, const Tail &...tail) { _write(head); cout << newl; write(tail...); } template void _debug(const T &a) { cerr << a; } template void _debug(const std::pair &a) { cerr << a.first << ' ' << a.second; } template void debug(const T &a) { _debug(a); cerr << newl; } template void debug(const vector &a) { for(int i = 0; i < a.size(); i++) { _debug(a[i]); cerr << (i + 1 == a.size() ? newl : ' '); } } template void debug(const Head &head, const Tail &...tail) { _debug(head); cerr << ' '; debug(tail...); } template void debugl(const T &a) { cerr << a << '\n'; } template void debugl(const vector &a) { for(int i = 0; i < a.size(); i++) { _debug(a[i]); cerr << newl; } } template void debugl(const Head &head, const Tail &...tail) { _debug(head); cerr << newl; debug(tail...); } template auto sum(const vector &a) { return accumulate(ALL(a), T(0)); } template auto min(const vector &a) { return *min_element(ALL(a)); } template auto max(const vector &a) { return *max_element(ALL(a)); } template void msort(vector &a, vector &b) { assert(a.size() == b.size()); vector> ab(a.size()); for(int i = 0; i < a.size(); i++) ab[i] = {a[i], b[i]}; sort(ALL(ab)); for(int i = 0; i < a.size(); i++) { a[i] = ab[i].first; b[i] = ab[i].second; } } template void msort(vector &a, vector &b, vector &c) { assert(a.size() == b.size() && b.size() == c.size()); vector> abc(a.size()); for(int i = 0; i < a.size(); i++) abc[i] = {a[i], b[i], c[i]}; sort(ALL(abc)); for(int i = 0; i < a.size(); i++) { a[i] = get<0>(abc[i]); b[i] = get<1>(abc[i]); c[i] = get<2>(abc[i]); } } template inline bool chmax(T &a, U b) { if(a < b) { a = b; return 1; } return 0; } template inline bool chmin(T &a, U b) { if(a > b) { a = b; return 1; } return 0; } int digit(ll a) { ll ret = 0; while(a && ++ret) a /= 10; return ret; } int digit_sum(ll a) { ll ret = 0; while(a) { ret += a % 10; a /= 10; } return ret; } ll llpow(ll a, ll n) { ll ret = 1; rep(i, n) ret *= a; return ret; } inline int bsf(int v) { return __builtin_ctz(v); } // 最下位の1が下から何番目か inline int bsf(ll v) { return __builtin_ctzll(v); } inline int bsr(int v) { return 31 - __builtin_clz(v); } // 最上位の1が下から何番目か inline int bsr(ll v) { return 63 - __builtin_clzll(v); } inline int lsb(int v) { return v & -v; } // 最下位の1だけ残す inline ll lsb(ll v) { return v & -v; } inline int msb(int v) { return 1 << bsr(v); } // 最上位の1だけ残す inline ll msb(ll v) { return 1LL << bsr(v); } struct IO { IO() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(10); } } io; #pragma endregion template class Graph { public: class Edge { public: int from, to; T cost; Edge() = default; Edge(int f, int t, T c) : from(f), to(t), cost(c) {} bool operator<(const Edge &rhs) const { return cost < rhs.cost; } }; vector> g; vector edges; int n; const T INF = numeric_limits::max(); Graph() = default; Graph(int n) : n(n), g(n) {} vector &operator[](int k) { return g[k]; } const vector &operator[](int k) const { return g[k]; } int size() const { return g.size(); } void resize(size_t sz) { g.resize(sz, vector()); } void add_edge(int u, int v) { g[u].push_back(Edge(u, v, 1)); edges.push_back(Edge(u, v, 1)); } void add_edge(int u, int v, T c) { g[u].push_back(Edge(u, v, c)); edges.push_back(Edge(u, v, c)); } void unite(int u, int v) { g[u].push_back(Edge(u, v, 1)); g[v].push_back(Edge(v, u, 1)); edges.push_back(Edge(u, v, 1)); } void unite(int u, int v, T c) { g[u].push_back(Edge(u, v, c)); g[v].push_back(Edge(v, u, c)); edges.push_back(Edge(u, v, c)); } vector dijkstra(int s) { priority_queue, vector>, greater>> que; vector dist(n, INF); dist[s] = 0; que.push(make_pair(0, s)); while(!que.empty()) { pair p = que.top(); que.pop(); int v = p.second; if(dist[v] < p.first) continue; for(auto e : g[v]) { if(dist[e.to] > dist[v] + e.cost) { dist[e.to] = dist[v] + e.cost; que.push(make_pair(dist[e.to], e.to)); } } } for(int i = 0; i < n; i++) if(dist[i] == INF) dist[i] = -1; return dist; } pair> bellman_ford(int s) { int n = g.size(); vector dist(n, INF); bool negative_cycle = false; dist[s] = 0; for(int i = 0; i < n; i++) { for(int v = 0; v < n; v++) { for(auto e : g[v]) { if(dist[v] != INF && dist[e.to] > dist[v] + e.cost) { dist[e.to] = dist[v] + e.cost; if(i == n - 1) { dist[e.to] = -INF; negative_cycle = true; } } } } } return {negative_cycle, dist}; } // 0 or 1 vector bipartite_split() { vector ret(n, -1); auto dfs = [&](auto &&dfs, int v, int p, bool pcolor) -> bool { ret[v] = !pcolor; for(auto e : g[v]) { if(v == p) continue; if(ret[v] == ret[e.to]) return false; if(ret[e.to] == -1 && !dfs(dfs, e.to, v, ret[v])) return false; } return true; }; for(int i = 0; i < n; i++) { if(ret[i] == -1 && !dfs(dfs, i, -1, 0)) return vector(); } return ret; } template pair> kruskal() { T sum = 0; sort(edges.begin(), edges.end()); vector ret; UnionFind uf(n); for(auto e : edges) { if(!uf.same(e.from, e.to)) { uf.unite(e.from, e.to); ret.push_back(e); sum += e.cost; } } return make_pair(sum, ret); } vector topological_sort() { vector ret; stack st; vector in(n); for(int i = 0; i < n; i++) { for(auto e : g[i]) { in[e.to] += 1; } } for(int i = 0; i < in.size(); i++) if(in[i] == 0) st.push(i); while(!st.empty()) { int v = st.top(); st.pop(); ret.push_back(v); for(auto e : g[v]) { in[e.to]--; if(in[e.to] == 0) st.push(e.to); } } return ret; } }; void solve() { INT(n, Q); Graph g(n); rep(i, n - 1) { INT(a, b); a--, b--; g.unite(a, b); } vector siz(n); auto f = [&](auto &&f, int v, int p) -> int { int s = 1; for(auto e : g[v]) { if(e.to == p) continue; s += f(f, e.to, v); } return siz[v] = s; }; f(f, 0, -1); ll res = 0; rep(i, Q) { LL(p, x); p--; res += x * siz[p]; write(res); } } int main() { int t = 1; // cin >> t; while(t--) { solve(); } }