from collections import Counter
import sys

sys.setrecursionlimit(10**6)

N = int(input())


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


uni = UnionFind(N)
temp_list = [0 for i in range(N)]
for i in range(N-1):
    a, b = list(map(int, input().split()))
    uni.union(a, b)
    temp_list[a] += 1
    temp_list[b] += 1



count = [i for i, x in enumerate(uni.parents) if x < 0]
count2 = Counter(temp_list)
if len(count) == 1:
    print("Bob")
elif len(count) == 2:
    if len(count2) == 2 and 2 in count2 and 0 in count2:
        if count2[2] == N-1 and count2[0] == 1:
            print("Bob")
        else:
            print("Alice")
    else:
        print("Alice")
else:
    print("Alice")