#include <bits/stdc++.h>
#define endl '\n'
#define F first
#define S second
using namespace std;
#define ll long long
#define pb push_back
#define mod 1000000007
#define int long long
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define CheckBit(x,k)   (x & (1LL << k))
#define SetBit(x,k)     (x |= (1LL << k))
#define ClearBit(x,k)   (x &= ~(1LL << k))
#define LSB(mask)       __builtin_ctzll(mask)
#define MSB(mask)       63-__builtin_clzll(mask) 
#define print(x)    cout << #x << " : " << x << endl
#define error1(x)   cerr << #x << " = " << (x) <<endl
#define coutall(v)  for(auto &it: v) cout<<it<<' '; cout<<endl
#define Abid_52     ios::sync_with_stdio(false);cin.tie(0),cin.tie(0)
#define error2(a,b) cerr<<"( "<<#a<<" , "<<#b<<" ) = ( "<<(a)<<" , "<<(b)<<" )\n"
#define UNIQUE(x)   sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
template <typename T, typename U> T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}
template <typename T, typename U> T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}

const int N = 1e5 + 10;
vector<int>g[N];
vector<int>vis(N+5,0),dis(N+5,0);
void dfs(int source)
{
    vis[source]=1;

    for(int child:g[source])
    {
        if(!vis[child])
        {
            dis[child]=dis[source]+1;
            dfs(child);
        }
    }
}
void solve()
{
    int n, m;
    cin >> n >> m;
    for(int i=0;i<=n;i++)
    {
        vis[i]=0;
        g[i].clear();
        dis[i]=0;
    }
    for(int i=0;i+1<n;i++)
    {
        int u,v;
        cin>>u>>v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    dfs(1);
    map<int,int>mp;
    for(int i=1;i<=n;i++)
    {
       mp[dis[i]]++;
    }
    vector<int>pre(n+1,0);
    for(int i=1;i<=n;i++)
    {
        mp[i]+=mp[i-1];
    }
    while(m--)
    {
        int val;
        cin>>val;
        cout<<mp[val]<<endl;
    }
}


int32_t main()
{
    Abid_52;
    int t = 1;
    cin >> t;
    for (int tc = 1; tc <= t; ++tc)
    {
        // cout << "Case " << tc << ": ";
        solve();
    }
}