#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

using ll = long long;

int main() {
    int N;
    cin >> N;
    vector<vector<int>> G(N);
    for (int i = 0; i < N - 1; i++) {
        int u, v; cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    queue<int> q;
    q.push(0);
    vector<bool> visited(N);
    visited[0] = true;
    while (!q.empty()) {
        int u = q.front(); q.pop();
        for (int v : G[u]) {
            if (!visited[v]) {
                visited[v] = true;
                q.push(v);
            }
        }
    }
    if (count(visited.begin(), visited.end(), false) == 0) {
        cout << "Bob" << endl;
        return 0;
    }
    if (count(visited.begin(), visited.end(), false) == 1) {
        int zero = 0;
        int two = 0;
        for (int i = 0; i < N; i++) {
            if (G[i].size() == 0) zero++;
            if (G[i].size() == 2) two++;
        }
        if (zero == 1 && two == N - 1) {
            cout << "Bob" << endl;
            return 0;
        }
    }
    cout << "Alice" << endl;
}