#include<bits/stdc++.h>
#define ll long long
#define Il inline
#define mem(u,v) memset(u,v,sizeof(u))
#define rep(i,a,b) for(ll i=(a),KKK##i=(b);i<=KKK##i;i++)
#define drep(i,a,b) for(ll i=(a),KKK##i=(b);i>=KKK##i;i--)
#define go(u) for(ll i=head[u],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#define writesp(x) write(x),putchar(' ')
#define writeln(x) write(x),puts("")
using namespace std;
Il ll read(){ll sum=0,f=0;char ch=getchar();for(;!isdigit(ch);ch=getchar())f|=(ch=='-');for(;isdigit(ch);ch=getchar())sum=((sum<<1)+(sum<<3)+(ch^48));return f?-sum:sum;}
void write(const ll x){if(x<0){putchar('-');write(-x);return;}if(x>9)write(x/10);putchar(x%10+'0');}
char getc(){char c=getchar();while(!isalpha(c))c=getchar();return c;}
#define N 1100000
ll n,m,x,y,tot,head[N],ans[N],S[N],RT[N];bool vis[N];
struct node{ll to,nxt;}e[N*2];
void add(ll f,ll to){e[++tot].to=to;e[tot].nxt=head[f];head[f]=tot;}
#define LC ch[rt][0]
#define RC ch[rt][1]
ll sum[N<<5],lz[N<<5],ch[N][2],cnt;
void pushup(ll rt){sum[rt]=sum[LC]+sum[RC];}
void pushdown(ll rt,ll dep){
	if(!lz[rt])return;
	if((lz[rt]>>dep)&1)swap(ch[rt][0],ch[rt][1]);
	lz[LC]^=lz[rt];lz[RC]^=lz[rt];
	lz[rt]=0;
}
void updata(ll&rt,ll dep,ll k){
	if(!rt)rt=++cnt;
//	cout<<"JA"<<rt<<' '<<dep<<' '<<k<<endl;
	if(!dep)return sum[rt]=1,void();pushdown(rt,dep);
	ll tmp=(k>>(dep-1))&1;
//	cout<<tmp<<endl;
	updata(ch[rt][tmp],dep-1,k);
	pushup(rt);
}
ll merge(ll rt,ll _rt,ll dep){
	if(!rt||!_rt)return rt|_rt;
	if(!dep){
		sum[rt]|=sum[_rt];
		return rt;
	}pushdown(rt,dep);pushdown(_rt,dep);
	sum[rt]+=sum[_rt];
	LC=merge(LC,ch[_rt][0],dep-1);
	RC=merge(RC,ch[_rt][1],dep-1);
	pushup(rt);return rt;
}
ll query(ll rt,ll dep,ll S){
//	cout<<"D"<<rt<<' '<<dep<<" "<<S<<' '<<sum[rt]<<' '<<sum[ch[rt][0]]<<' '<<sum[ch[rt][1]]<<endl;
	if(!dep)return S;pushdown(rt,dep);
	if(sum[ch[rt][0]]==(1ll<<(dep-1)))return query(RC,dep-1,S*2+1);
//	puts("LEFT");
	return query(LC,dep-1,S*2);
}
void tag(ll rt,ll k){
	lz[rt]^=k;
}
void dfs(ll u,ll fa){
	vis[u]=1;
	go(u)if(v!=fa)dfs(v,u),S[u]^=ans[v];
	go(u)if(v!=fa)tag(RT[v],S[u]^ans[v]),RT[u]=merge(RT[u],RT[v],20);
//	cout<<query(RT[u],20,0)<<endl;
	updata(RT[u],20,S[u]);
	ans[u]=query(RT[u],20,0);
//	cout<<"DE"<<u<<" "<<S[u]<<" "<<ans[u]<<endl;
}
int main(){
	drep(__,read(),1){
		n=read();m=read();ll HA=0;
		rep(i,1,m)x=read(),y=read(),add(x,y),add(y,x);
		rep(i,1,n)if(!vis[i])dfs(i,0),HA^=ans[i];
		puts(HA==0?"Bob":"Alice");
		rep(i,1,n)vis[i]=0,head[i]=0,RT[i]=0,S[i]=0,ans[i]=0;tot=0;
		rep(i,1,cnt)ch[i][0]=ch[i][1]=0;cnt=0;
	}
}