#include<bits/stdc++.h>
#define flush() fflush(stdout)
const int MAXN = 111;

std::vector<int>g[MAXN];
int fa[MAXN],sum[MAXN],size[MAXN], leaves[MAXN],dep[MAXN];
int mark[MAXN];
int p,r;
void dfs0(int u)
{
	sum[u]=mark[u],size[u]=1;
	leaves[u]= (g[u].size()==1);
	for(auto v:g[u])
		if(v!=fa[u])
		{
			fa[v]=u,dep[v]=dep[u]+1;
			dfs0(v);
			sum[u]+=sum[v],leaves[u]+=leaves[v];
			size[u]+=size[v];
		}
	if(!mark[u]&&sum[u]<size[u]-leaves[u]+1)
	{
		bool f=g[u].size()>1||u==r;
		bool pr=g[p].size()>1||p==r;
		if((f>pr)||(f==pr&& dep[u]>dep[p]))p=u;
	}
}
void clear(){memset(fa,0,sizeof fa),memset(dep,0,sizeof dep),memset(size,0,sizeof size);p=0;}
int fast(int n)
{
	for(int u=1;u<=n;++u)
		if(!mark[u])
		{
			bool ok=0;
			for(auto v:g[u])
				if(mark[v])ok=1;
			if(!ok)return u;
		}
	return 0;
}
int main()
{
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=1;i<n;++i)
	{
		int u,v;
		scanf("%d%d",&u,&v);
		++u,++v;
		g[u].emplace_back(v),g[v].emplace_back(u);
	}
	int all=0;
	for(int u=1;u<=n;++u)
		if(g[u].size()==1)r=u,++all;
	
	int rm=m-(n-all+1);	
	if(rm>=0)
	{
		puts("DEFEND"),flush();
		for(int u=1;u<=n;++u)
			if(g[u].size()==1)
			{
				if(u==r)mark[u]=1;
				else if(rm)mark[u]=1,--rm;
			}
			else mark[u]=1;
		for(int u=1;u<=n;++u)
			if(mark[u])printf("%d ",u-1);
		puts(""),flush();
		clear(),dfs0(r);
		for(int T=1;T<=365;++T)
		{
			int x;//announce x
			scanf("%d",&x);
			if(x==-1)return 0;
			++x;
			if(mark[x]){puts("0"),flush();continue;}
			//x must be a leaf
			mark[x]=1,mark[r]=0;
			r=x;
			printf("%d ",dep[x]);
			while(fa[x])printf("%d %d ",fa[x]-1,x-1),x=fa[x];
			puts(""),flush();
			clear(),dfs0(r);
		}
	}
	else
	{
		puts("ATTACK"),flush();
		int x;
		for(int w=1;w<=m;++w)scanf("%d",&x),mark[++x]=1;
		clear(),dfs0(r);
		for(int T=1;T<=n;++T)
		{
			int v=fast(n);
			if(v)
			{
				printf("%d\n",v-1),flush();
				return 0;
			}
			printf("%d\n",p-1),flush();
			bool ok=0;
			for(auto v:g[p])
				if(mark[v])ok=1;
			if(!ok)return 0;
			int k;
			scanf("%d",&k);
			while(k--)
			{
				int x,y;
				scanf("%d%d",&x,&y);
				++x,++y;
				--mark[x],++mark[y];
			}
			clear(),dfs0(r);
		}
	}
	return 0;
}