#include <bits/stdc++.h>

const int N = ;

#define gc getchar()

inline int read() {

    int x = ; char c = gc;

    while(c < '' || c > '') c = gc;

    while(c >= '' && c <= '') x = x *  + c - '', c = gc;

    return x;

}

int head[N], cnt;

struct Node {

    int u, v, nxt;

} G[N << ];

int n, q;

int v[N];

int f[N][N], g[N][N];

int size[N];

inline void Add(int u, int v) {G[++ cnt].v = v; G[cnt].nxt = head[u]; head[u] = cnt;}

void Dfs(int x, int fa) {

    size[x] = , f[x][] = g[x][] = v[x];

    for(int i = head[x]; ~ i; i = G[i].nxt) {

        int v = G[i].v;

        if(v != fa) {

            Dfs(v, x);

            for(int j = size[x]; j >= ; j --) {

                for(int k = size[v]; k >= ; k --) {

                    f[x][j + k] = std:: min(f[x][j + k], f[x][j] + f[v][k]);

                    g[x][j + k] = std:: max(g[x][j + k], g[x][j] + g[v][k]);

                }

            }

            size[x] += size[v];

        }

    }

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

        f[][i] = std:: min(f[][i], f[x][i]);

        g[][i] = std:: max(g[][i], g[x][i]);

    }

}

int main() {

    int t = read();

    for(; t; t --) {

        cnt = ;

        memset(f, 0x3f, sizeof f);

        memset(g, 0xc0, sizeof g);

        n = read(); q = read();

        for(int i = ; i <= n; i ++) head[i] = -;

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

            int u = read(), v = read();

            Add(u, v), Add(v, u);

        }

        for(int i = ; i <= n; i ++) v[i] = read();

        Dfs(, );

        for(; q; q --) {

            int x = read(), y = read();

            if(f[][x] <= y && y <= g[][x]) puts("YES");

            else puts("NO");

        }

        puts("");

    }

    return ;

}