#include<iostream>

 #include<cstring>

 #include<cstdio>

 #define N (5009)

 using namespace std;

 struct Edge{int to,next;}edge[N<<];

 int n,u,v,T,q,INF=1e4,size[N],b[N];

 short f[N][N],g[N][N],tmpf[N],tmpg[N],ans[N][N];

 int head[N],num_edge;

 void add(int u,int v)

 {

     edge[++num_edge].to=v;

     edge[num_edge].next=head[u];

     head[u]=num_edge;

 }

 void Dfs(int x,int fa)

 {

     size[x]=;

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

         f[x][i]=INF,g[x][i]=-INF;

     f[x][b[x]]=g[x][b[x]]=;

     for (int i=head[x]; i; i=edge[i].next)

         if (edge[i].to!=fa)

         {

             int to=edge[i].to;

             Dfs(to,x);

             for (int j=; j<=size[x]+size[to]; ++j)

                 tmpf[j]=INF,tmpg[j]=-INF;

             for (int j=; j<=size[x]; ++j)

                 for (int k=; k<=size[to]; ++k)

                 {

                     tmpf[j+k]=min((int)tmpf[j+k],(int)f[x][j]+f[to][k]);

                     tmpg[j+k]=max((int)tmpg[j+k],(int)g[x][j]+g[to][k]);

                 }

             size[x]+=size[to];

             for (int j=; j<=size[x]; ++j)

             {

                 f[x][j]=min(f[x][j],tmpf[j]);

                 g[x][j]=max(g[x][j],tmpg[j]);

             }

         }

     for (int i=; i<=size[x]; ++i)

         if (f[x][i]<INF)

             ans[f[x][i]][i]++,ans[g[x][i]+][i]--;

 }

 int main()

 {

     scanf("%d",&T);

     while (T--)

     {

         memset(ans,,sizeof(ans));

         memset(head,,sizeof(head));

         num_edge=;

         scanf("%d%d",&n,&q);

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

             scanf("%d%d",&u,&v),add(u,v),add(v,u);

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

             scanf("%d",&b[i]);

         Dfs(,);

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

             for (int j=; j<=n; ++j)

                 ans[i][j]+=ans[i-][j];

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

         {

             scanf("%d%d",&u,&v);

             if (ans[u][v]) puts("YES");

             else puts("NO");

         }

         puts("");

     }

 }