def dfs(x,p):
  cnt=1
  for i in g[x]:
    if i!=p:
      cnt+=dfs(i,x)
    ans[x]=cnt
  return cnt
n,q=map(int,input().split())
g=[[] for i in range(n+1)]
for i in range(n-1):
  a,b=map(int,input().split())
  g[a-1].append(b-1)
  g[b-1].append(a-1)
ans=[0]*(n+1)
dfs(0,-1)
a=0
for i in range(q):
  p,x=map(int,input().split())
  a+=ans[p-1]*x
  print(a)