#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>

using namespace std;

#define int long long
#define endl "\n"

constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007; 

string yn(bool f){return f?"Yes":"No";}
string YN(bool f){return f?"YES":"NO";}

class union_find
{
	int  _setnum;
	vector<int> par, nume;
public:
	union_find(){
	}
	
	union_find(int x){
		par.resize(x);
		nume.resize(x);
		init();
	}
	
	~union_find(){
		//
		
	}
	
	void clear(){
		_setnum = 0;
		par.clear();
		nume.clear();
	}
	
	void init(){
		_setnum = par.size();
		for(int i = 0; i < par.size(); i++){
			par[i] = i;
			nume[i] = 1;
		}
	}
	
	void resize(int x){
		
		par.resize(x);
		nume.resize(x);
		init();
	}

	int find(int x){
		return par[x] == x ? x : par[x] = find(par[x]);
	}

	void unite(int x, int y){
		x = find(x);
		y = find(y);
	
		if(x == y)return;
		
		_setnum--;
		
		if(nume[x] > nume[y]) std::swap(x,y);
		
		par[x] = y;
		nume[y] += nume[x];
	}
	
	bool same(int x, int y){
		return find(x) == find(y);
	}
	
	int numel(int x){
		return nume[find(x)];
	}
	
	int size(){
		return par.size();
	}
	
	int setnum(){
		return _setnum;
	}
};


signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);
	
	int N;
	union_find uf;
	vector<int> used;
	vector<int> con;
	
	int c = 0;
	cin>>N;
	
	uf.resize(N);
	used.resize(N);
	con.resize(N);
	
	for(int i = 0; i < N-1; i++){
		int u, v;
		
		cin>>u>>v;
		
		uf.unite(u,v);
		
		con[u]++;
		con[v]++;
	}
	
	for(int i = 0; i < N; i++){
		if(used[uf.find(i)]) continue;
		used[uf.find(i)] = true;
		
		if(uf.numel(i) == 1) c++;
	}
	
	if(c == 1 && uf.setnum() == 2){
		bool flag = true;
		for(int i = 0; i < N; i++){
			if(uf.numel(i) == 1) continue;
			if(con[i] != 2) flag = false;
		}
		
		if(flag) cout<<"Bob"<<endl;
		else cout<<"Alice"<<endl;
	}
	else if(uf.setnum() == 1) cout<<"Bob"<<endl;
	else cout<<"Alice"<<endl;
	
	
	return 0;
}