#include <bits/stdc++.h>
using namespace std;
using lint = long long;

struct UnionFind{
	vector<lint> rnk,par,num;
	UnionFind(lint N) : rnk(N),par(N),num(N){
		init();
	}
	void init(){
		for(lint i = 0;i < rnk.size();i++){
			rnk[i] = 0;
			par[i] = i;
			num[i] = 1;
		}
	}
	lint find(lint x){
		if(par[x] == x) return x;
		return par[x] = find(par[x]);
	}
	void unite(lint x,lint y){
		x = find(x);
		y = find(y);
		if(x == y) return;
		if(rnk[x] < rnk[y]){
			par[x] = y;
			num[y] += num[x];
		}
		else{
			par[y] = x;
			num[x] += num[y];
			if(rnk[x] == rnk[y]) rnk[x]++;
		}
	}
	bool same(lint x,lint y){
		return (find(x) == find(y));
	}
	lint size(lint x){
		return num[find(x)];
	}
};

signed main(){
	int n; cin >> n;
	UnionFind tree(n);
	vector<vector<int> > G(n);
	for(int i = 1; i < n; i++){
		int a, b; scanf("%d%d", &a, &b);
		tree.unite(a, b);
		G[a].push_back(b); G[b].push_back(a);
	}
	int c = 0;
	for(int i = 0; i < n; i++) if(tree.find(i) == i) c++;
	string ans;
	if(c == 1) ans = "Bob";
	if(c > 2) ans = "Alice";
	if(c == 2){
	  int a = -1, b;
	  for(int i = 0; i < n; i++){
		  if(tree.find(i) == i){
			  if(a < 0) a = tree.size(i);
			  else b = tree.size(i);
		  }
	  }
	  if(a < b) swap(a, b);
	  if(a == n - 1 && b == 1){
		  bool ok = true;
		  for(int i = 0; i < n; i++) if(G[i].size() != 2 && G[i].size() != 0) ok = false;
		  if(ok) ans = "Bob";
		  else ans = "Alice";
		}
		else ans = "Alice";
	}
	cout << ans << endl;
}