hdu 4607

#pragma comment(linker, "/STACK:102400000,102400000")
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
#include<ctime>
using namespace std;
#ifdef _WIN32
typedef __int64 i64;
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
typedef long long i64;
#define out64 "%lld\n"
#define in64 "%lld"
#endif
/************ for topcoder by zz1215 *******************/
#define foreach(c,itr)  for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)
#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a)         for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a,b)      for( int i = (a) ; i >= (b) ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define pb              push_back
#define pf              push_front
#define X               first
#define Y               second
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define MC(a,b)		memcpy(a,b,sizeof(b))
#define MAX(a,b)        ((a)>(b)?(a):(b))
#define MIN(a,b)        ((a)<(b)?(a):(b))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-9;
const double pi = acos(-1.0);
const int maxn = 101111;

int T;
int n, m;
vector<int>g[maxn];
int dp[maxn];
bool vis[maxn];
int maxlen;

int dfs(int now)
{	
	vis[now] = true;	
	dp[now] = 0;
	int to,temp;
	vector<int>v;
	v.push_back(0);
	v.push_back(0);
	for (int i = 0; i < g[now].size(); i++){
		to = g[now][i];
		if (!vis[to]){
			v.push_back(dfs(to) + 1);
		}
	}
	sort(v.begin(), v.end());
	reverse(v.begin(), v.end());
	dp[now] = v[0];
	maxlen = max(maxlen, v[0] + v[1]);
	return dp[now];
}



void start()
{
	for (int i = 1; i <= n; i++){
		vis[i] = false;
	}
	maxlen = 0;
	dfs(1);
	return;
}

int main()
{
	cin >> T;
	while (T--){
		cin >> n >> m;
		for (int i = 1; i <= n; i++){
			g[i].clear();
		}
		int now, to;
		for (int i = 1; i < n; i++){
			cin >> now >> to;
			g[now].push_back(to);
			g[to].push_back(now);
		}
		start();
		int x;
		for (int i = 1; i <= m; i++){
			cin >> x;
			if (x <= maxlen + 1){
				printf("%d\n", x - 1);
			}
			else{
				printf("%d\n", x * 2 - maxlen - 2);
			}
		}

	}
	return 0;
}