N = int(input())

parent = list(range(N))
import sys
sys.setrecursionlimit(10 ** 8)
def find(i):
    if parent[i] == i:return i
    parent[i] = find(parent[i])
    return parent[i]
def unite(i,j):
    I = find(i)
    J = find(j)
    if I == J:return False
    parent[I] = J
    parent[i] = J
    return True
Gnum = [0] * N
for _ in range(N-1):
    u,v = map(int,input().split())
    Gnum[u] += 1
    Gnum[v] += 1
    unite(u,v)
s = set()
for i in range(N):
    s.add(find(i))
if len(s) == 1:
    print("Bob")
elif len(s) >= 3:
    print("Alice")
else:
    flag = False
    for i in Gnum:
        if i == 1:
            flag = True
            break
    if flag:
        print('Alice')
    else:
        print('Bob')