写着写着写不下去了……

#include <iostream>
#include <vector>
using namespace std;
struct Ans
{
	int address,count=0;
};
const int MAXN=5e3+1;
const int MAXK=1e3+1;
const int MAXH=5e2+1;
int k,n,h,f[MAXH];
Ans ans[MAXK];
vector<int> a[MAXN];
vector<int> l[MAXK];
vector<int> b;
void dfs(int e,int f,int g)
{
	int len=a[e].size();
	for (int i=0;i<len;i++)
	{
		if (a[e][i]==g)
		{
			continue;
		}
		
	}
}
void pass(int x)
{
	for (int i=1;i<=k;i++)
	{
		dfs(ans[i].address,x,0);
	}
}

int main()
{
	cin >> n;
	for (int i=1;i<=n-1;i++)
	{
		int x,y;
		cin >> x >> y;
		a[x].push_back(y);
		a[y].push_back(x);
	}
	cin >> k;
	for (int i=1;i<=k;i++)
	{
		cin >> ans[i].address;
	}
	cin >> h;
	for (int i=1;i<=h;i++)
	{
		cin >> f[i];
	}
	for (int i=1;i<=h;i++)
	{
		pass(i);
	}
	
	return 0;
}