#include<bits./stdc++.h>
using namespace std;
#define ll long long
#define MAXN 10010
ll hd[MAXN],nxt[MAXN],ed[MAXN];
ll f[MAXN],used[MAXN];
ll find(ll idx){
    if(f[idx]==idx)return idx;
    else return f[idx]=find(f[idx]);
}
ll n,m,idx;
void build(ll x,ll y){
    nxt[++idx]=hd[x];
    hd[x]=idx;
    ed[idx]=y;
}
int main(){
    freopen("icekingdom.in","r",stdin);
    freopen("icekingdom.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<n;i++){
        int x,y;
        cin>>x>>y;
        build(x,y);
        build(y,x);
    }
    for(int i=1;i<=m;i++){
        int l,r;
        cin>>l>>r;
        int ans=0;
        for(int j=1;j<=n;j++){
            f[j]=j;
            used[j]=0;
        }
        for(int j=l;j<=r;j++){
            for(int now=hd[j];now;now=nxt[now]){
                int y=ed[now];
                if(y>=l&&y<=r){
                    f[j]=find(y);
//                    cout<<j<<" "<<y<<endl;
                }
            }
        }
        for(int j=l;j<=r;j++){
            if(!used[find(j)]){
                used[find(j)]=1;
                ans++;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}