#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
#include<functional>
#include<utility>
using namespace std;

#include<algorithm>
#include<vector>
#include<cassert>
using namespace std;
struct UnionFind
{
	private:
	int n;
	vector<int> par,siz;

	public:
	UnionFind(int n) :n(n),par(n,-1),siz(n,1) {}

	int root(int u)
	{
		assert(0 <= u && u < n);
		return (par[u] < 0 ? u:par[u] = root(par[u]));
	}

	bool same(int u,int v)
	{
		assert(0 <= u && u < n && 0 <= v && v < n);
		return root(u) == root(v);
	}

	bool unite(int u,int v)
	{
		assert(0 <= u && u < n && 0 <= v && v < n);
		u = root(u),v = root(v);
		if(u == v) return false;

		if(siz[u] < siz[v]) swap(u,v);

		siz[u] += siz[v];
		par[v] = u;

		return true;
	}

	int size(int u)
	{
		assert(0 <= u && u < n);
		return siz[root(u)];
	}

	vector<vector<int>> components()
	{
		vector<vector<int>> ret(n);
		for(int u = 0;u < n;u++) ret[root(u)].push_back(u);

		ret.erase(remove_if(ret.begin(),ret.end(),[](vector<int> v) { return v.empty();}),ret.end());

		return ret;
	}
};
int N,deg[1 << 17];
void solve()
{
	cin >> N;
	UnionFind uf(N);
	for(int i = 1;i < N;i++)
	{
		int u,v;
		cin >> u >> v;
		uf.unite(u,v);
		deg[u]++,deg[v]++;
	}
	int count = 0;
	for(int i = 0;i < N;i++) if(uf.root(i) == i) count++;
	if(count >= 3) cout << "Alice" << endl;
	else if(count == 2)
	{
		int one = 0;
		for(int i = 0;i < N;i++) if(uf.size(i) == 1) one = 1;
		if(!one) cout << "Alice" << endl;
		else
		{
			int B = 1;
			for(int i = 0;i < N;i++) if(uf.size(i) > 1) B &= deg[i] == 2;
			cout << (B ? "Bob":"Alice") << endl;
		}
	}
	else cout << "Bob" << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
}