#include<bits/stdc++.h>
#define fq(i,d,u) for(int i(d); i<=u; ++i)
#define fr(i,u,d) for(int i(u); i>=d; --i)
#define sf scanf
#define pf printf
using namespace std;
const int N = 1e5 + 5;

int n,m;
vector<int> tr[N];
int fa[N],siz[N];

int sg[N];
bool vis[N],del[N];
list <int> st;
int tmp[N],cnt;

void get(int p){
    // cout << p <<"&\n";
    st.push_back(p); del[p] = 1;

    for(auto to : tr[p]){
        if(to == fa[p]) continue;
        get(to);
    }

    if(st.size() != siz[st.front()]) ++cnt;
    for(auto x : st)
        for(auto to : tr[x])
        if(to != fa[x] && !del[to]) tmp[cnt] ^= sg[to];

    del[st.back()] = 0;
    st.pop_back();
}
void dfs1(int x,int f){
    siz[x] = vis[x] = 1; fa[x] = f;
    for(auto to : tr[x]) {
        if(to == f) continue;
        dfs1(to,x);
        siz[x] += siz[to];
    }

    cnt = 0;
    get(x);
    sort(tmp + 1,tmp + 1 + n);
    fq(i,1,cnt) {if(sg[x] < tmp[i]) break; sg[x] = tmp[i] + 1;}
}
void solve(){
    cin >> n >> m;
    fq(i,1,m) {
        int u,v; cin >> u >> v;
        tr[u].push_back(v);
        tr[v].push_back(u);
    }

    int ans(0);
    fq(i,1,n) if(!vis[i]) {dfs1(i,i); ans ^= sg[i];}
    // fq(i,1,n) pf("%d ",sg[i]); pf("#\n");

    if(!ans) pf("Bob\n");
    else pf("Alice\n");

    fq(i,1,n) {tr[i].clear(); siz[i] = vis[i] = 0; sg[i] = 0;}
}
int main(){

    // memset(sg,-1,sizeof(sg));
    int T; cin >> T;
    while(T--) {solve();}

    return 0;
}