#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
#define PI 3.141592653589793

struct UnionFind{
	vector<int> par,siz;
	UnionFind(int N): par(N), siz(N){
		rep(i, N){
			par[i] = i; siz[i] = 1;
		}
	}
	int root(int x){
		if(par[x]==x) return x;
		else return root(par[x]);
	}
	void unite(int x, int y){
		x=root(x); y=root(y);
		if(x==y) return;
		if(siz[x] < siz[y]) swap(x, y);
		par[y] = x;
		siz[x] += siz[y];
	}
	bool same(int x, int y){
		return root(x)==root(y);
	}
	int size(int x){
		return siz[root(x)];
	}
};

int main(){
  int N; cin >> N; vector<int> to[N];
  UnionFind uf(N);
  rep(i, N-1){
    int u, v; cin >> u >> v;
    to[u].push_back(v); to[v].push_back(u);
    uf.unite(u, v);
  }
  int one=0, two=0;
  rep(i, N){
    if(to[i].size()==1) one++;
    else if(to[i].size()==2) two++; 
  }
  bool can = false;
  if(uf.size(0)==N) can=true;
  if(two==N-1) can=true;
  if(can) cout << "Bob" << endl;
  else cout << "Alice" << endl;
}