#include <bits/stdc++.h>
#include <string>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) (a)=max(a, b)
#define chmin(a, b) (a)=min(a, b)
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7;

/*
 for(i=0; i<N; i++)
   cin >> a[i];
*/

class unionFind {
public:
  vector<ll> data;
  
  unionFind(ll size) {
    data.assign(size, -1);
  }
  
  bool same(ll x, ll y) {
    return find(x)==find(y);
  }
  
  void unite(ll x, ll y) {
    x=find(x);
    y=find(y);
    if(x==y) return;
    if(data[x]>data[y]) swap(x, y);
    data[x]+=data[y];
    data[y]=x;
  }
  
  ll find(ll k) {
    if(data[k]<0) return k;
    return data[k]=find(data[k]);
  }
  
  ll size(ll k) {
    return -data[find(k)];
  }
  
};


int main(void) {
  ll i, j, k;
  
  ll N;
  cin >> N;
  vector<ll> g[MAX];
  
  unionFind uf=unionFind(N);
  for(i=0; i<N-1; i++) {
    ll u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
    uf.unite(u, v);
  }
  
  map<ll, vector<ll>> mp;
  for(i=0; i<N; i++) mp[uf.find(i)].push_back(i);
  
  if(mp.size()>=3) {pt("Alice"); return 0;}
  
  if(mp.size()==1) {
    pt("Bob");
  }else {
    auto p=mp.begin();
    auto q=mp.begin();
    q++;
    
    if(p->sc.size()==1) {
      vector<ll> v=q->sc;
      for(i=0; i<v.size(); i++) {
        ll u=v[i];
        if(g[u].size()<2) {
          pt("Alice");
          return 0;
        }
      }
      
      pt("Bob");
      
    }else if(q->sc.size()==1) {
      vector<ll> v=p->sc;
      for(i=0; i<v.size(); i++) {
        ll u=v[i];
        if(g[u].size()<2) {
          pt("Alice");
          return 0;
        }
      }
      
      pt("Bob");
      
    }else {
      pt("Alice");
    }
    
  }
    
  
  
  
}