#include <iostream> #include <algorithm> #include <string> #include <vector> #include <cmath> #include <map> #include <queue> #include <iomanip> #include <set> #include <tuple> #define mkp make_pair #define mkt make_tuple #define rep(i,n) for(int i = 0; i < (n); ++i) using namespace std; typedef long long ll; const ll MOD=1e9+7; class DisjointSet{ public: vector<int> rank,p; vector<int> sz; DisjointSet(){} DisjointSet(int size){ rank.resize(size,0); p.resize(size,0); sz.resize(size,0); for(int i=0;i<size;i++) makeSet(i); } void makeSet(int x){ p[x]=x; rank[x]=0; sz[x]=1; } bool same(int x,int y){ return findSet(x)==findSet(y); } void unite(int x,int y){ if(same(x,y)) return; link(findSet(x),findSet(y)); } void link(int x,int y){ if(rank[x]>rank[y]){ p[y]=x; sz[x]+=sz[y]; }else{ p[x]=y; sz[y]+=sz[x]; if(rank[x]==rank[y]){ rank[y]++; } } } int findSet(int x){ if(x!=p[x]){ p[x]=findSet(p[x]); } return p[x]; } int findSize(int x){ return sz[findSet(x)]; } }; int main(){ int N; cin>>N; vector<int> u(N-1),v(N-1); rep(i,N-1) cin>>u[i]>>v[i]; DisjointSet us(N); vector<int> deg(N,0); rep(i,N-1){ deg[u[i]]++; deg[v[i]]++; if(us.same(u[i],v[i])); else us.unite(u[i],v[i]); } int com=0; rep(i,N) if(us.findSet(i)==i) com++; if(com==1) cout<<"Bob"<<endl; else if(com==2){ bool ok=false; rep(i,N) if(deg[i]==1) ok=true; if(ok) cout<<"Alice"<<endl; else cout<<"Bob"<<endl; }else cout<<"Alice"<<endl; return 0; }