#include<iostream>

 #include<cstdio>

 #include<cmath>

 #include<cstdlib>

 #include<cstring>

 #include<algorithm>

 #include<vector>

 #include<queue>

 #include<map>

 #define inf 2139062143

 #define ll long long

 #define MAXN 200100

 using namespace std;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(!isdigit(ch)) {if(ch=='-') f=-;ch=getchar();}

     while(isdigit(ch)) {x=x*+ch-'';ch=getchar();}

     return x*f;

 }

 int n,m,f[MAXN][],dep[MAXN],hsh[MAXN],sz[MAXN],val[MAXN<<];

 int nxt[MAXN<<],fst[MAXN],to[MAXN<<],cnt,rt[MAXN],ls[MAXN<<],rs[MAXN<<];

 void add(int u,int v) {nxt[++cnt]=fst[u],fst[u]=cnt,to[cnt]=v;}

 void dfs(int x)

 {

     hsh[x]=++cnt,sz[x]=;

     for(int i=;(<<i)<=dep[x];i++) f[x][i]=f[f[x][i-]][i-];

     for(int i=fst[x];i;i=nxt[i])

         if(to[i]!=f[x][]){dep[to[i]]=dep[x]+,f[to[i]][]=x;dfs(to[i]);sz[x]+=sz[to[i]];}

 }

 int lca(int u,int v)

 {

     if(dep[u]<dep[v]) swap(u,v);

     int t=dep[u]-dep[v];

     for(int i=;i<=;i++)

         if((<<i)&t) u=f[u][i];

     if(u==v) return u;

     for(int i=;i>=;i--)

         if(f[u][i]!=f[v][i]) u=f[u][i],v=f[v][i];

     return f[u][];

 }

 void inst(int &k,int l,int r,int x)

 {

     if(!k) k=++cnt;

     val[k]++;

     if(l==r) return ;

     int mid=(l+r)>>;

     if(x<=mid) inst(ls[k],l,mid,x);

     else inst(rs[k],mid+,r,x);

 }

 void merge(int &a,int b)

 {

     if(!a) {a=b;return ;}

     if(!b) return ;

     val[a]+=val[b];

     merge(ls[a],ls[b]);

     merge(rs[a],rs[b]);

 }

 int query(int k1,int k2,int l,int r,int a,int b)

 {

     if(!k1) return ;

     if(l==a&&r==b) return val[k1]-val[k2];

     int mid=(l+r)>>;

     if(b<=mid) return query(ls[k1],ls[k2],l,mid,a,b);

     else if(a>mid) return query(rs[k1],rs[k2],mid+,r,a,b);

     else return query(ls[k1],ls[k2],l,mid,a,mid)+query(rs[k1],rs[k2],mid+,r,mid+,b);

 }

 int ans(int k1,int k2,int l,int r,int x)

 {

     //cout<<l<<" "<<r<<" "<<val[k1]-val[k2]<<" "<<x<<endl;

     if(l==r) return l;

     int mid=(l+r)>>;

     if(x<=val[ls[k1]]-val[ls[k2]]) return ans(ls[k1],ls[k2],l,mid,x);

     else return ans(rs[k1],rs[k2],mid+,r,x-val[ls[k1]]+val[ls[k2]]);

 }

 int main()

 {

     n=read(),m=read();int a,b,c;

     for(int i=;i<n;i++) {a=read(),b=read();add(a,b);add(b,a);}

     cnt=;dfs();cnt=;

     while(m--)

     {

         a=read(),b=read(),c=lca(a,b);

         inst(rt[hsh[a]],,n,dep[c]+);

         inst(rt[hsh[b]],,n,dep[c]+);

     }

     for(int i=;i<=n;i++) merge(rt[i],rt[i-]);

     m=read();

     while(m--)

     {

         a=read(),b=read();

         //cout<<query(rt[hsh[a]+sz[a]-1],rt[hsh[a]-1],1,n,1,dep[a]+1)<<endl;

         if(query(rt[hsh[a]+sz[a]-],rt[hsh[a]-],,n,,dep[a]+)<b) puts("");

         else printf("%d\n",dep[a]+-ans(rt[hsh[a]+sz[a]-],rt[hsh[a]-],,n,b));

     }

 }