class UnionFind():
    def __init__(self, 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 group_count(self):
        return len([0 for x in self.parents if x < 0])

N = int(input())
uf = UnionFind(N)
a = [0] * N
for _ in range(N-1):
    u, v = map(int, input().split())
    uf.union(u, v)
    a[u] += 1
    a[v] += 1
c = uf.group_count()
if c >= 3:
    print("Alice")
elif c == 2 and a.count(1):
    print("Alice")
else:
    print("Bob")