#include<iostream>
#include<cmath>
#include<cstring>
#include<queue>
#include<vector>
#include<cstdio>
#include<algorithm>
#include<map>
#include<set>
#include<stack>
#define rep(i,e) for(int i=0;i<(e);i++)
#define rep1(i,e) for(int i=1;i<=(e);i++)
#define repx(i,x,e) for(int i=(x);i<=(e);i++)
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define mset(var,val) memset(var,val,sizeof(var))
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define pd(a) printf("%d\n",a)
#define scl(a) scanf("%lld",&a)
#define scll(a,b) scanf("%lld%lld",&a,&b)
#define sclll(a,b,c) scanf("%lld%lld%lld",&a,&b,&c)
#define IOS ios::sync_with_stdio(false);cin.tie(0)using namespace std;
typedef long long ll;
template <class T>
void test(T a){cout<<a<<endl;}
template <class T,class T2>
void test(T a,T2 b){cout<<a<<" "<<b<<endl;}
template <class T,class T2,class T3>
void test(T a,T2 b,T3 c){cout<<a<<" "<<b<<" "<<c<<endl;}
const int N = 1e6+10;
//const int MAXN = 210;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const ll mod = 1000000007;
int T;
void testcase(){printf("Case #%d: ",++T);
}
const int MAXN = 1e5+5;
const int MAXM = 30;struct Edge{int to,nxt;
}edge[MAXN<<1];int n,m,cnt,head[MAXN];
int dis[MAXN];void init(){cnt=0;mset(head,-1);
}
void addedge(int u,int v){edge[cnt].to=v;edge[cnt].nxt=head[u];head[u]=cnt++;
}void DFS(int u){for(int i=head[u];i!=-1;i=edge[i].nxt){int v=edge[i].to;if(dis[v]==-1){dis[v]=dis[u]+1;DFS(v);}}
}int main(){
#ifdef LOCALfreopen("in.txt","r",stdin);
#endif // LOCALint t;scanf("%d",&t);while(t--){init();scdd(n,m);int u,v;for(int i=1;i<n;i++){scdd(u,v);addedge(u,v);addedge(v,u);}mset(dis,-1);dis[1]=0;DFS(1);int len=0;for(int i=1;i<=n;i++)if(dis[i]>len){len=dis[i];u=i;}mset(dis,-1);dis[u]=0;DFS(u);len=0;for(int i=1;i<=n;i++)if(dis[i]>len)len=dis[i];len++;int k;while(m--){scanf("%d",&k);if(len>=k)cout<<k-1<<endl;elsecout<<(len-1)+(k-len)*2<<endl;}}return 0;
}