N = int(input())

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.root = [-1]*(n+1)
        self.rnk = [0]*(n+1)

    def find_root(self, x):
        if self.root[x] < 0:
            return x
        else:
            self.root[x] = self.find_root(self.root[x])
            return self.root[x]

    def unite(self, x, y):
        x = self.find_root(x)
        y = self.find_root(y)
        if x == y:
            return
        elif self.rnk[x] > self.rnk[y]:
            self.root[x] += self.root[y]
            self.root[y] = x
        else:
            self.root[y] += self.root[x]
            self.root[x] = y
            if self.rnk[x] == self.rnk[y]:
                self.rnk[y] += 1

    def isSameGroup(self, x, y):
        return self.find_root(x) == self.find_root(y)

uf = UnionFind(N)
E = [0]*N
for _ in range(N-1):
    u,v = map(int, input().split())
    uf.unite(u+1, v+1)
    E[u] += 1
    E[v] += 1


cnt = 0
for i in range(1, N+1):
    if uf.root[i] < 0:
        cnt += 1

if cnt >= 3:
    ans = "Alice"
elif cnt == 2 and 1 in E:
    ans = "Alice"
else:
    ans = "Bob"
print(ans)