#include<algorithm>
#include<iostream>
#include<random>
#include<vector>
#include<cstdio>
using namespace std;
#define For(i,l,r) for(int i=l;i<=r;i++)
#define FOR(i,l,r) for(int i=l;i>=r;i--)
#define lowbit(x) x&-x
#define MAXN 1000001
int N,M,type[MAXN],c[MAXN],tot,dfn[MAXN],siz[MAXN],fa[MAXN],dep[MAXN],son[MAXN],top[MAXN],x[MAXN],y[MAXN],bit[MAXN],ans[MAXN];vector<int>E[MAXN],E2[MAXN],id[MAXN];vector<pair<int,int>>opt[MAXN],ask[MAXN];
int get(){int x=0,f=1;char c=getchar();while(c<'0'||c>'9')c=='-'&&(f=-1),c=getchar();while(c>='0'&&c<='9')x=x*10+c-'0',c=getchar();return x*f;}
void dfs1(int u,int f){siz[u]=1,dep[u]=dep[f]+1,fa[u]=f;for(auto v:E[u])if(v!=f)dfs1(v,u),siz[u]+=siz[v],siz[v]>siz[son[u]]&&(son[u]=v);}
void dfs2(int u,int t){top[u]=t,dfn[u]=++tot;if(!son[u])return;dfs2(son[u],t);for(auto v:E[u])if(v!=fa[u]&&v!=son[u])dfs2(v,v);}
int lca(int x,int y){while(top[x]!=top[y]){if(dep[top[x]]<dep[top[y]])swap(x,y);x=fa[top[x]];}return dep[x]<dep[y]?x:y;}
int nxt(int x,int y){if(dfn[y]>=dfn[son[x]]&&dfn[y]<dfn[son[x]]+siz[son[x]])return son[x];while(fa[top[y]]!=x)y=fa[top[y]];return top[y];}
void add(int x,int y)
{
	int z=lca(x,y);if(z!=x&&z!=y){opt[dfn[x]].push_back({dfn[y],dfn[y]+siz[y]-1});opt[dfn[x]+siz[x]].push_back({-dfn[y],-(dfn[y]+siz[y]-1)});return;}
	if(z==x){x=nxt(x,y);opt[1].push_back({dfn[y],dfn[y]+siz[y]-1});opt[dfn[x]].push_back({-dfn[y],-(dfn[y]+siz[y]-1)});opt[dfn[x]+siz[x]].push_back({dfn[y],dfn[y]+siz[y]-1});return;}
	y=nxt(y,x);opt[dfn[x]].push_back({1,dfn[y]-1});opt[dfn[x]].push_back({dfn[y]+siz[y],N});
	opt[dfn[x]+siz[x]].push_back({-1,-(dfn[y]-1)});opt[dfn[x]+siz[x]].push_back({-dfn[y]-siz[y],-N});
}
void dfs3(int u,int f,int rt,int col,int val)
{
	for(auto v:E2[u])if(v!=f)
	{
		if(c[v]==col&&type[v]==2&&val==0){add(rt,v);continue;}
		int y=c[v]==col?type[v]==1?1:-1:0;dfs3(v,u,rt,col,val+y);
	}
}
void upd(int x,int v){for(int i=x;i<=N;i+=lowbit(i))bit[i]+=v;}int query(int x){int ans=0;for(int i=x;i;i-=lowbit(i))ans+=bit[i];return ans;}
void Upd(int l,int r){if(l<0||r<0)upd(-l,-1),upd(-r+1,1);else upd(l,1),upd(r+1,-1);}
int main()
{
	N=get(),M=get();For(i,1,N)type[i]=get(),c[i]=get(),id[c[i]].push_back(i);
	For(i,1,N-1){int u=get(),v=get();E[u].push_back(v),E[v].push_back(u);}For(i,1,M)x[i]=get(),y[i]=get();
	dfs1(1,0);dfs2(1,1);For(i,1,N)sort(id[i].begin(),id[i].end(),[&](const int&a,const int&b){return dfn[a]<dfn[b];});
	For(i,1,N)if(!id[i].empty())
	{
		vector<int>sta,nodes;sta.push_back(1);nodes.push_back(1);
		for(auto u:id[i])
		{
			int x=lca(sta.back(),u);if(u==sta.back())continue;
			while(x!=sta.back())
			{
				int y=sta[sta.size()-2];
				if(dep[x]>dep[y]){int z=sta.back();sta.pop_back();nodes.push_back(x);nodes.push_back(z);E2[z].push_back(x);E2[x].push_back(z);sta.push_back(x);break;}
				if(x==y){int z=sta.back();sta.pop_back();nodes.push_back(x);nodes.push_back(z);E2[z].push_back(x);E2[x].push_back(z);break;}
				int z=sta.back();sta.pop_back();nodes.push_back(y);nodes.push_back(z);E2[z].push_back(y);E2[y].push_back(z);
			}
			if(u!=sta.back())sta.push_back(u);
		}
		while(sta.size()>1)nodes.push_back(sta.back()),E2[sta.back()].push_back(sta[sta.size()-2]),E2[sta[sta.size()-2]].push_back(sta.back()),sta.pop_back();
		for(auto u:id[i])if(type[u]==1)dfs3(u,0,u,i,0);for(auto u:nodes)E2[u].clear();
	}
	For(i,1,M)ask[dfn[x[i]]].push_back({i,dfn[y[i]]});
	For(i,1,N){for(auto j:opt[i])Upd(j.first,j.second);for(auto j:ask[i])ans[j.first]=query(j.second);}
	For(i,1,M)cout<<ans[i]<<'\n';
}