#include<iostream>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue> 
#define ll long long
using namespace std;
int n,q;
vector<int> mp[200010];
int ed[200010],li,ri;
void f(int x,int m){
	queue<int> que;
	que.push(x);
	ed[x]=m;
	while(!que.empty()){
		int fr=que.front();
		for(int i=0;i<mp[fr].size();i++){
			if(mp[fr][i]<li||mp[fr][i]>ri||ed[mp[fr][i]]) continue;
			ed[mp[fr][i]]=m;
			que.push(mp[fr][i]);
		}
		que.pop();
	}
}
int main(){
    freopen("icekingdom.in","r",stdin);
    freopen("icekingdom.out","w",stdout);
    
    scanf("%d%d",&n,&q);
    for(int i=1;i<n;i++){
    	int a,b;scanf("%d%d",&a,&b);
    	mp[a].push_back(b);
    	mp[b].push_back(a);
	}
	while(q--){
		int ans=0;
		scanf("%d%d",&li,&ri);
		for(int p=li;p<=ri;p++) if(!ed[p]) ans++,f(p,ans);
		printf("%d\n",ans);
		memset(ed,0,sizeof ed);
	}
    
    return 0;
}