#include <bits/stdc++.h>
#define FastIO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
typedef long long ll;
bool solve(bool player, ll city, const ll N, const vector<vector<ll>> &graph, vector<ll> &dp) {
    ll key = city + player * N;
    ll &ans = dp[key];
    if(ans != -1)
        return ans;
    if(player) {
        ans = false;
        for(const auto &x : graph[city]) {
            if(solve(false, x, N, graph, dp)) {
                ans = true;
                break;
            }
        }
    }
    else {
        ans = true;
        for(const auto &x : graph[city]) {
            if(!solve(true, x, N, graph, dp)) {
                ans = false;
                break;
            }
        }
    }
    return ans;
}
int main() {
    FastIO;
    ll i, u, v, N, M, Q;
    cin >> N >> M >> Q;
    vector<ll> cities(Q);
    for(i = 0; i < Q; i++) {
        cin >> cities[i];
        cities[i]--;
    }
    vector<vector<ll>> graph(N);
    for(i = 0; i < M; i++) {
        cin >> u >> v;
        graph[u - 1].push_back(v - 1);
    }
    vector<ll> dp(N * 2, -1);
    for(const auto &x : cities)
        cout << (solve(true, x, N, graph, dp) ? 'A' : 'B') << '\n';
    return 0;
}