#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<unordered_map>
#include<bitset>
#define N 200000
#define M 1000000
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int n,q,dfn[N+1],rev[N+1],leng,lengths,ST[N+1][21],lg[N+1],delta[N+1],tong[N+1],length,pst[N+1],num[N+1][10],sfa[N+1][21],rt[N+1],sz[N+1],belong[N+1],fa[N+1],depth[N+1];
char c[N+1];
bool used[N+1];
vector<int>E[N+1];
unordered_map<int,int>dp[N+1];
struct reads
{
	int x,y,data;
	bool operator < (const reads &t)const
	{
		if (data!=t.data) return data<t.data;
		else if (x!=t.x) return x<t.x;
		else return y<t.y;
	}
};
reads tongs[M+1];
void add(int x,int y)
{
	E[x].push_back(y),E[y].push_back(x);
	return;
}
void dfs(int x)
{
	dfn[x]=++leng,rev[dfn[x]]=x,sz[x]=1,num[x][c[x]-'0']=x,tong[++length]=dfn[x],pst[x]=length;
	for (int i=0;i<E[x].size();++i)
		if (!dfn[E[x][i]])
		{
			for (int j=0;j<=9;++j) num[E[x][i]][j]=num[x][j];
			fa[E[x][i]]=x,depth[E[x][i]]=depth[x]+1,dfs(E[x][i]),sz[x]+=sz[E[x][i]],tong[++length]=dfn[x];
		}
	return;
}
bool LENG(int x,int y)
{
	return dfn[x]<=dfn[y]&&dfn[y]<=dfn[x]+sz[x]-1;
}
int find(int x)
{
	if (rt[x]==x) return x;
	int y=find(rt[x]);
	delta[x]^=delta[rt[x]];
	return rt[x]=y;
}
void unionn(int x,int y,int z)
{
	rt[x]=y,delta[x]=z;
	return;
}
int lca(int x,int y)
{
	x=pst[x],y=pst[y];
	if (x>y) swap(x,y);
	int lw=lg[y-x+1];
	return rev[min(ST[x][lw],ST[y-(1<<lw)+1][lw])];
}
int calc(int x)
{
	find(x);
	return delta[x];
}
int solve(int x,int y)
{
	return calc(y)^calc(x);
}
int get(int x,int d)
{
	for (int i=lg[n<<1];i>=0;--i)
		if (depth[sfa[x][i]]>=d)
			x=sfa[x][i];
	return x;
}
int query(int x,int y)
{
	if (dfn[x]>dfn[y]) swap(x,y);
	if (x==fa[y]||x==y) return 0;
	if (dp[x].find(y)!=dp[x].end()) return dp[x][y];
	int sx,sy,tx,ty,res;
	bitset<16>used;
	used.set();
	if (LENG(x,y))
	{
		for (int i=0;i<=9;++i)
			if (depth[num[fa[y]][i]]>depth[x])
				sy=num[fa[y]][i],sx=get(sy,depth[x]+1),res=solve(sx,sy)^query(x,sx)^query(sy,y),used[res]=0;
	}
	else
	{
		int z=lca(x,y);
		for (int i=0;i<=9;++i)
			if (depth[num[fa[x]][i]]>=depth[z]||depth[num[fa[y]][i]]>=depth[z])
			{
				if (depth[num[fa[x]][i]]>=depth[z]&&depth[num[fa[y]][i]]>=depth[z])
				{
					sy=num[fa[x]][i],sx=get(sy,depth[z]);
					ty=num[fa[y]][i],tx=get(ty,depth[z]);
					res=solve(sx,sy)^solve(tx,ty)^query(sy,x)^query(sx,tx)^query(ty,y),used[res]=0;
				}
				else if (depth[num[fa[x]][i]]>=depth[z])
				{
					sy=num[fa[x]][i],sx=get(sy,depth[z]);
					res=solve(sx,sy)^query(sy,x)^query(sx,y),used[res]=0;
				}
				else
				{
					sy=num[fa[y]][i],sx=get(sy,depth[z]);
					res=solve(sx,sy)^query(sy,y)^query(sx,x),used[res]=0;
				}
			}
	}
	res=used._Find_first();
	return dp[x][y]=res;
}
int query2(int x,int y)
{
	if (dfn[x]>dfn[y]) swap(x,y);
	int sx,sy,tx,ty,res,cnt=0;
	if (LENG(x,y))
	{
		for (int i=0;i<=9;++i)
			if (depth[num[fa[y]][i]]>depth[x])
			{
				sy=num[fa[y]][i],sx=get(sy,depth[x]+1),res=solve(sx,sy)^query(x,sx)^query(sy,y);
				if (!res) cnt++;
			}
	}
	else
	{
		int z=lca(x,y);
		for (int i=0;i<=9;++i)
			if (depth[num[fa[x]][i]]>=depth[z]||depth[num[fa[y]][i]]>=depth[z])
			{
				if (depth[num[fa[x]][i]]>=depth[z]&&depth[num[fa[y]][i]]>=depth[z])
				{
					sy=num[fa[x]][i],sx=get(sy,depth[z]);
					ty=num[fa[y]][i],tx=get(ty,depth[z]);
					res=solve(sx,sy)^solve(tx,ty)^query(sy,x)^query(sx,tx)^query(ty,y);
					if (!res) cnt++;
				}
				else if (depth[num[fa[x]][i]]>=depth[z])
				{
					sy=num[fa[x]][i],sx=get(sy,depth[z]);
					res=solve(sx,sy)^query(sy,x)^query(sx,y);
					if (!res) cnt++;
				}
				else
				{
					sy=num[fa[y]][i],sx=get(sy,depth[z]);
					res=solve(sx,sy)^query(sy,y)^query(sx,x);
					if (!res) cnt++;
				}
			}
	}
	return cnt;
}
int main()
{
	int x,y,res;
	for (int i=2;i<=N;++i) lg[i]=lg[i>>1]+1;
	n=read(),q=read();
	for (int i=1;i<=n;++i) cin>>c[i],c[i+n]='0';
	for (int i=1;i<=n;++i) add(i,i+n);
	for (int i=1;i<=(n<<1);++i) rt[i]=i;
	for (int i=1;i<=n-1;++i) x=read(),y=read(),add(x,y);
	depth[1]=1,dfs(1);
	for (int i=1;i<=length;++i) ST[i][0]=tong[i];
	for (int i=1;i<=lg[length];++i)
		for (int j=1;j+(1<<i)-1<=length;++j)
			ST[j][i]=min(ST[j][i-1],ST[j+(1<<(i-1))][i-1]);
	for (int i=0;i<=9;++i)
		for (int j=i;j<=9;++j)
		{
			for (int k=1;k<=(n<<1);++k) used[k]=(c[k]-'0'==i||c[k]-'0'==j);
			for (int k=1;k<=(n<<1);++k)
			{
				x=rev[k];
				if (used[x])
				{
					if (belong[fa[x]])
					{
						if (i==j) sfa[x][0]=belong[fa[x]];
						tongs[++lengths]=(reads){belong[fa[x]],x,depth[x]-depth[belong[fa[x]]]};
					}
					belong[x]=x;
				}
				else belong[x]=belong[fa[x]];
			}
		}
	for (int i=1;i<=lg[n<<1];++i)
		for (int j=1;j<=(n<<1);++j)
			sfa[j][i]=sfa[sfa[j][i-1]][i-1];
	sort(tongs+1,tongs+lengths+1);
	for (int i=1;i<=lengths;++i)
		if (i==1||tongs[i].x!=tongs[i-1].x||tongs[i].y!=tongs[i-1].y)
		{
			res=query(tongs[i].x,tongs[i].y);
			if (c[tongs[i].x]==c[tongs[i].y]) unionn(tongs[i].y,tongs[i].x,res);
		}
	for (int qt=1;qt<=q;++qt)
	{
		x=read(),y=read();
		if (x==y) puts("Alice 1");
		else
		{
			query2(x+n,y+n);
			if (query(x+n,y+n)) printf("Alice %d\n",query2(x+n,y+n));
			else puts("Bob");
		}
	}
	return 0;
}