from collections import Counter

class UnionFind:
    def __init__(self, n):
        self.parent = [i for i in range(n)]
    def find(self, x):
        if self.parent[x] == x:
            return x
        self.parent[x] = self.find(self.parent[x])
        return self.parent[x]
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        self.parent[x] = y

def main():
    N = int(input())
    deg = [0] * N
    uf = UnionFind(N)
    for _ in range(N-1):
        u, v = map(int, input().split())
        deg[u] += 1
        deg[v] += 1
        uf.union(u, v)
    s = set(uf.find(i) for i in range(N))
    sets = len(s)
    dc = Counter(deg)
    bob = (sets == 1) or (sets == 2 and dc[0] == 1 and dc[2] == N - 1)
    print('Bob' if bob else 'Alice')

main()