#include <bits/stdc++.h>
using namespace std;
vector<int> g[1000001];
vector<bool> mego;
void dfs(int x, int p){
    cout<<x<<" "<<p<<" "<<mego[x]<<endl;
    if (mego[x]) return;
    else{
        mego[x]=!mego[p];
        for (int edge:g[x]){
            dfs(edge,x);
        }
    }
}
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);
    }
    mego[0]=1;
    for (int i=1; i<=n;i++){
            if (x[i]==0){
                dfs(i,0);
            }
    }
   for (int x: ans) cout<<(mego[x]? "A\n" :"B\n");


}