#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cmath>

#define File(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout)

#define maxn 100010

#define MAXN 1600010

using namespace std;

typedef long long llg;

int T,n,m,sg[maxn],ans;

int head[maxn],next[maxn<<1],to[maxn<<1],tt;

int s[MAXN][2],rt[maxn],ao[MAXN],siz[MAXN];

bool vis[maxn];

int getint(){

	int w=0;bool q=0;

	char c=getchar();

	while((c>'9'||c<'0')&&c!='-') c=getchar();

	if(c=='-') c=getchar(),q=1;

	while(c>='0'&&c<='9') w=w*10+c-'0',c=getchar();

	return q?-w:w;

}

int pop(){int u=++tt;s[u][0]=s[u][1]=ao[u]=0;siz[u]=1;return u;}

void link(int x,int y){

	to[++tt]=y;next[tt]=head[x];head[x]=tt;

	to[++tt]=x;next[tt]=head[y];head[y]=tt;

}

void pudn(int u,int k){

	if((ao[u]>>k)&1) swap(s[u][0],s[u][1]);

	int o=ao[u]&((1<<k)-1); ao[u]=0;

	ao[s[u][0]]^=o;ao[s[u][1]]^=o;

}

int merge(int u,int v,int k){

	if(!u || !v) return u+v;

	pudn(u,k); pudn(v,k);

	s[u][1]=merge(s[u][1],s[v][1],k-1);

	s[u][0]=merge(s[u][0],s[v][0],k-1);

	return u;

}

int getans(int u){

	int now=0;

	for(int i=16;i>=0;i--){

		now<<=1;

		if(siz[s[u][0]]<(1<<i)) u=s[u][0];

		else u=s[u][1],now|=1;

	}

	return now;

}

void ins(int &u,int x,int k){

	if(!u) u=pop();

	if(k>=0){

		pudn(u,k); ins(s[u][(x>>k)&1],x,k-1);

		siz[u]=siz[s[u][0]]+siz[s[u][1]];

	}

}

void dfs(int u,int fa){

	vis[u]=1; int now=0;

	for(int i=head[u],v;v=to[i],i;i=next[i])

		if(v!=fa) dfs(v,u),now^=sg[v];

	for(int i=head[u],v;v=to[i],i;i=next[i])

		if(v!=fa) ao[rt[v]]^=now^sg[v],rt[u]=merge(rt[u],rt[v],16);

	ins(rt[u],now,16),sg[u]=getans(rt[u]);

}

int main(){

	File("a");

	T=getint();

	while(T--){

		n=getint(),m=getint(); ans=tt=0;

		while(m--) link(getint(),getint());

		for(int i=1;i<=n;i++)

			if(!vis[i]) tt=0,dfs(i,0),ans^=sg[i];

		printf(ans?"Alice\n":"Bob\n");

		for(int i=1;i<=n;i++) rt[i]=sg[i]=head[i]=vis[i]=0;

	}

	return 0;

}