#include using namespace std; vector adj[100005]; int dp[100005]; int dfs(int now,int prev) { dp[now] = 1; for(auto next : adj[now]) { if(prev==next) { continue; } dp[now] += dfs(next,now); } return dp[now]; } int main(void) { cin.tie(0); ios::sync_with_stdio(false); int n,q,a,b; cin >> n >> q; for(int i=0;i> a >> b; adj[a].push_back(b); adj[b].push_back(a); } dfs(1,0); long long int sum = 0; for(int i=0;i> a >> b; long long int res = dp[a]; res*=b; sum += res; cout << sum << '\n'; } return 0; }