from collections import defaultdict
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
 
    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
 
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
 
        if x == y:
            return
 
        if self.parents[x] > self.parents[y]:
            x, y = y, x
 
        self.parents[x] += self.parents[y]
        self.parents[y] = x
 
    def size(self, x):
        return -self.parents[self.find(x)]
 
    def same(self, x, y):
        return self.find(x) == self.find(y)
 
    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
 
    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]
 
    def group_count(self):
        return len(self.roots())
 
    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members
from collections import deque
N = int(input())
uf = UnionFind(N)
l = [0 for _ in range(N)]
for _ in range(N-1):
    v1,v2 = map(int,input().split())
    uf.union(v1,v2)
    l[v1] += 1
    l[v2] += 1

num = 0
for i in range(N):
    num = max(num,uf.size(i))
ans = "Alice"
check = False
if l.count(2) == N-1 and l.count(0) == 1:
    check = True
if num == N or (num == N-1 and check):
    ans = "Bob"
print(ans)