def main():
    import sys
    input = sys.stdin.readline

    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)

        def size(self, x):
            return -self.root[self.find_root(x)]

    N = int(input())
    UF = UnionFind(N+1)
    adj = [[] for _ in range(N)]
    for _ in range(N-1):
        u, v = map(int, input().split())
        UF.unite(u, v)
        adj[u].append(v)
        adj[v].append(u)
    s = UF.size(0)
    if s == N:
        print('Bob')
    elif s == N-1 or s == 1:
        flg = 0
        for v in range(N):
            if len(adj[v]) == 1:
                flg += 1
        if flg:
            print('Alice')
        else:
            print('Bob')
    else:
        print('Alice')


if __name__ == '__main__':
    main()