#include <bits/stdc++.h>
using namespace std;
vector<int> g[1000001];
vector<bool> mego;

int main()
{
    int n,m,k;
    cin>>n>>m>>k;
    mego.resize(n+1, {0});
    vector<int> ans;
    for (int q=0; q<k;q++){
        int x;
        cin>>x;
        ans.push_back(x);
    }
    vector<int> x(n+1,0);
    for (int i=0; i<m;i++){
        int a,b;
        cin>>a>>b;
        x[a]++;
        g[b].push_back(a);
    }
    queue<int> q;
    for (int i=1; i<=n;i++){
            if (x[i]==0){
                q.push(i);

            }
    }
    while (!q.empty()){
        int v=q.front();
        q.pop();
        for (int edge: g[v]){
            if (mego[edge]!=1){
                mego[edge]=!mego[v];
            }
            q.push(edge);

        }
    }

   for (int x: ans) cout<<(mego[x]==1? "A\n" :"B\n");


}