不知道为什么全都TLE了

#include <iostream>
#include <vector>
#include <cstring>
using namespace std;

const int maxn=2005;
int n,m,k,q,u,v,t,a[maxn],fa[maxn],dep[maxn],val[maxn],nex[maxn],son[maxn];
vector<int>G[maxn];
int f[maxn][4101],g[maxn][4101];
bool vis1[maxn][4101],vis2[maxn][4101];
int solveg(int u,int t);

int solvef(int u,int t)
{
	if ((dep[u]+1)%k==0)
	{
		t+=(k-1);
	}
	//cout<<u<<" "<<t<<" "<<endl;
	int &ans=f[u][t];
	if (vis1[u][t])
	{
		return ans;
	}
	vis1[u][t]=1;
	if (u==0||t==0)
	{
		ans=0;
		return 0;
	}
	ans=solveg(son[u],t);
	//cout<<u<<" "<<t<<" "<<ans<<endl;
	return ans;
}

int solveg(int u,int t)
{
	int &ans=g[u][t];
	if (vis2[u][t])
	{
		return ans;
	}
	vis2[u][t]=1;
	if (t==0||u==0)
	{
		ans=0;
		return 0;
	}
	ans=solveg(nex[u],t);
	for (int i=0;i<=t-2;i++)
	{
		ans=max(ans,val[u]+solvef(u,i)+solveg(nex[u],t-2-i));
	}
//	cout<<u<<" "<<t<<" "<<ans<<endl;
	return ans;
}
void dfs(int u,int f)
{
	dep[u]=dep[f]+1;
	fa[u]=f;
	int sz=G[u].size();
	int pre=0;
	for (int i=0;i<sz;i++)
	{
		int v=G[u][i];
		if (v!=f)
		{
			if (pre==0)
			{
				son[u]=v;
			}
			else
			{
				nex[pre]=v;
			}
			pre=v;
			dfs(v,u);
		}
	}
}
int main()
{
	dep[0]=-1;
	cin>>n>>m>>k>>q;
	for (int i=1;i<n;i++)
	{
		cin>>u>>v;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	for (int i=1;i<=m;i++)
	{
		cin>>a[i];
		val[a[i]]++;
	}
	dfs(1,0);
	for (int i=1;i<=q;i++)
	{
		cin>>t;
		cout<<val[1]+solvef(1,t)<<endl;
	}
}