#include using namespace std; #define F first #define S second #define R cin>> #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) ll check(ll n,ll m,ll x,ll y){return x>=0&&x=0&&yvoid pr(const A &a,const B&...b){cout<void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")< P; ll d[111111]; vector v[111111]; ll dfs(int x,int p) { d[x]++; rep(i,v[x].size()) { ll y=v[x][i]; if(p!=y) d[x]+=dfs(y,x); } return d[x]; } void Main() { ll n,T; cin >> n >> T; rep(i,n-1) { ll x,y; cin >> x >> y; x--,y--; v[x].pb(y); v[y].pb(x); } dfs(0,-1); ll sum=0; while(T--) { ll x,y; cin >> x >> y; x--; sum+=y*d[x]; pr(sum); } } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}