#include<cstdio>
#include<queue>
#include<cctype>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=3e5+5;
inline int read(){int X=0,w=0;char ch=0;while(!isdigit(ch)){w|=ch=='-';ch=getchar();}while(isdigit(ch))X=(X<<3)+(X<<1)+(ch^48),ch=getchar();return w?-X:X;
}
struct node{int to,nxt;
}e[N*2];
struct tree{int l,r;ll sum;
}tr[N*20];
int cnt,n,q,head[N],sz[N],dep[N];
int rt[N],idx[N],tot,pool,maxd;
inline void add(int u,int v){e[++cnt].to=v;e[cnt].nxt=head[u];head[u]=cnt;
}
void insert(int y,int &x,int l,int r,int p,ll w){tr[x=++pool]=tr[y];tr[x].sum+=w;if(l==r)return;int mid=(l+r)>>1;if(p<=mid)insert(tr[y].l,tr[x].l,l,mid,p,w);else insert(tr[y].r,tr[x].r,mid+1,r,p,w);
}
ll query(int y,int x,int l,int r,int l1,int r1){if(r1<l||r<l1)return 0;if(l1<=l&&r<=r1)return tr[x].sum-tr[y].sum;int mid=(l+r)>>1;return query(tr[y].l,tr[x].l,l,mid,l1,r1)+query(tr[y].r,tr[x].r,mid+1,r,l1,r1);
}
void dfs1(int u,int f,int d){idx[u]=++tot;sz[u]=1;dep[u]=d;maxd=max(maxd,d);for(int i=head[u];i;i=e[i].nxt){int v=e[i].to;if(v==f)continue;dfs1(v,u,d+1);sz[u]+=sz[v];}
}
void dfs2(int u,int f){insert(rt[idx[u]-1],rt[idx[u]],1,maxd,dep[u],sz[u]-1);//错误点，曾经写成insert(rt[idx[f]],rt[idx[u]],1,maxd,dep[u],sz[u]-1);for(int i=head[u];i;i=e[i].nxt){int v=e[i].to;if(v==f)continue;dfs2(v,u);}
}
int main(){n=read(),q=read();for(int i=1;i<n;i++){int u=read(),v=read();add(u,v);add(v,u);}dfs1(1,0,1);dfs2(1,0);for(int i=1;i<=q;i++){int p=read(),k=read();ll ans=(ll)(sz[p]-1)*min(dep[p]-1,k);ans+=query(rt[idx[p]-1],rt[idx[p]+sz[p]-1],1,maxd,dep[p]+1,dep[p]+k);printf("%lld\n",ans);}return 0;
}