#include<bits/stdc++.h>
using namespace std;
#define LL long long
struct edge{
	LL to,nt;
}a[400005];
LL son[8000005][2];
LL nxt[400005],root[400005],val[400005];
LL sum[8000005];
LL tmp[400005];
LL sg[400005];
queue<LL> q;
bool vis[400005];
LL n,i,j,k,m,cnt=0,x,y,ans,t;
void add(LL x,LL y){
	a[++cnt].to=y;a[cnt].nt=nxt[x];nxt[x]=cnt;
}
void insert(LL x,LL num,LL step){
	if(step==-1){
		sum[x]=1;
		return ;
	}
	LL tmp=(num>>(step))&1;
	if(son[x][tmp]==0){
		if(!q.empty()){
			son[x][tmp]=q.front();
			son[q.front()][0]=son[q.front()][1]=0;
			q.pop();
		}
		else son[x][tmp]=++cnt;
	}
	//printf("%lld %lld %lld\n",x,son[x][0],son[x][1]);
	insert(son[x][tmp],num,step-1);
	sum[x]=sum[son[x][0]]+sum[son[x][1]];
	//printf("%lld %lld %lld\n",x,sum[x],step);
}
LL getnum(LL x,LL num,LL step){
	if(step==-1) return 0;
	if(x==0) return 0; 
	LL tmp=(num>>(step))&1;
	//printf("%lld %lld %lld\n",x,step,num);
	if(sum[son[x][tmp]]!=(1<<(step))) return getnum(son[x][tmp],num,step-1);
	else return getnum(son[x][tmp^1],num,step-1)+(1<<(step)); 
}
void merge(LL x,LL y,LL num,LL step){
	q.push(y);
	if(step==-1){
		insert(root[x],num^val[x],20);
		return ;
	}
	LL num0=son[y][0],num1=son[y][1];
	if(num0>0) merge(x,num0,num,step-1);
	if(num1>0) merge(x,num1,num^(1<<step),step-1);
}
void dfs(LL father,LL x){
	vis[x]=true;
	LL now=0,sum1=0,num=0;
	for(LL i=nxt[x];i;i=a[i].nt)
	  if(a[i].to!=father){
	  	dfs(x,a[i].to);
	  	sum1++;
	  	num^=sg[a[i].to]; 
	  }
	if(sum1==0){
		sg[x]=1;
		root[x]=++cnt;
		val[x]=1;
		tmp[x]=1;
		insert(root[x],0,20);
		insert(root[x],1,20);
		return ;
	}
	for(LL i=nxt[x];i;i=a[i].nt)
	  if(a[i].to!=father){
	  	if(now==0){
	  		now=a[i].to;
		}
	  	else{
	  		//printf("%lld %lld %lld %lld\n",x,a[i].to,tmp[x],tmp[a[i].to]);
	  		if(tmp[x]<tmp[a[i].to]){
	  		    merge(a[i].to,root[now],val[now],20);
				now=a[i].to;
			}
			else merge(now,root[a[i].to],val[a[i].to],20);
		}
		tmp[x]+=tmp[a[i].to];
	  }
	tmp[x]++;
	//printf("%lld %lld\n",x,now);
	root[x]=root[now];
	val[x]=val[now];
	val[x]^=num;
	sg[x]=getnum(root[x],val[x],20);
	insert(root[x],val[x]^sg[x],20);
	//printf("%lld %lld\n",x,num);
	val[x]^=sg[x];
}

int main(){
	scanf("%lld",&t);
	while(t--){
		scanf("%lld%lld",&n,&m);
		for(i=1;i<=n;i++)
		  vis[i]=false,nxt[i]=0,root[i]=0,val[i]=0,sg[i]=0;
		while(!q.empty()) q.pop();
		for(i=1;i<=cnt;i++)
		  sum[i]=son[i][0]=son[i][1]=0;
		cnt=0;
		for(i=1;i<=m;i++){
			scanf("%lld%lld",&x,&y);
			add(x,y);add(y,x);
		}
		cnt=0;
		ans=0;
		for(i=1;i<=n;i++)
		  if(vis[i]==false){
		  	dfs(0,i);
		  	ans^=sg[i];
		  	//printf("%lld ",sg[i]);
		  }
		/*for(i=1;i<=n;i++)
		  printf("%lld ",sg[i]);
		printf("\n");
		for(i=1;i<=n;i++)
		  printf("%lld ",sum[i]);
		printf("\n");*/
		if(ans>0) printf("Alice\n");
		else printf("Bob\n");
	}
	return 0;
}