N = int(input())
UV = [list(map(int,input().split())) for _ in range(N-1)]
P = [i for i in range(N)]

def find(x):
    if P[x] == x: return x
    else:
        P[x] = find(P[x]) #経路圧縮
        return P[x]
        # return find(P[x]) #経路圧縮なし

def same(x,y):
    return find(x) == find(y)

def unite(x,y):
    x = find(x)
    y = find(y)
    if x == y: return 0
    if x > y: x,y = y,x
    P[y] = x

def group_count():
    for i in range(N):
        P[i] = find(i)
    return len(set(P))

for u,v in UV:
    unite(u,v)
gc = group_count()
if gc == 1:
    print("Bob")
elif gc > 2:
    print("Alice")
else:
    D = [0] * N
    for u,v in UV:
        D[u] += 1
        D[v] += 1
    if D.count(0) == 1 and D.count(2) == N - 1:
        print("Bob")
    else:
        print("Alice")