#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<vector>
using namespace std;
vector<int> e[100005];
int n,m,dist[100005],k;
void dfs(int u,int father)
{
    for(int i=0;i<e[u].size();i++)
    {
        int v=e[u][i];
        if(v==father)
            continue;
        dist[v]=dist[u]+1;
        dfs(v,u);
    }
}
int main()
{
    int tt;
    scanf("%d",&tt);
    while(tt--)
    {
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
            e[i].clear();
        for(int i=1;i<n;i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            e[x].push_back(y);
            e[y].push_back(x);
        }
        memset(dist,0,sizeof(dist));
        dfs(1,-1);
        int len=0,u;
        for(int i=1;i<=n;i++)
        {
            if(dist[i]>len)
            {
                len=dist[i];
                u=i;
            }
        }
        memset(dist,0,sizeof(dist));
        dfs(u,-1);
        len=0;
        for(int i=1;i<=n;i++)
        {
            if(dist[i]>len)
                len=dist[i];
        }
        len++;
        while(m--)
        {
            scanf("%d",&k);
            if(len>=k)
            {
                printf("%d\n",k-1);
            }
            else
            {
                printf("%d\n",(k-len)*2+len-1);
            }
        }
    }
    return 0;
}