#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int N, M, Q, be1, be2;
vector<int> ellista[200005];
int h[200005]; //0-undefined, 1-nyero, -1 veszto
bool voltmar[200005]; //0-undefined, 1-nyero, -1 veszto
vector<int> kerd;

struct alma
{
    int cs;
    int be=0;
};
alma sor[200005];
bool Rend(alma a, alma b)
{
    return (a.be<b.be);
}
int Mely(int cs)
{
    voltmar[cs]=true;

    int alatta=0;
    for(int a:ellista[cs])
    {
        if(voltmar[a]==false)
        {
            Mely(a);
        }
        alatta=min(alatta, h[a]);
    }
    if((alatta==-1)) //Minden nyero
    {
        h[cs]=1;
        return 1;
    }
    else
    {
        h[cs]=-1;
        return -1;
    }
}

int main()
{
    cin >> N >> M >> Q;
    for(int i = 0; i < Q; i++)
    {
        cin >> be1; kerd.push_back(be1);
    }
    for(int i = 1; i <= N; i++) sor[i].cs=i;
    for(int i = 0; i < M; i++)
    {
        cin >> be1 >> be2;
        ellista[be1].push_back(be2);
        sor[be2].be++;
    }
    sort(sor+1, sor+N+1, Rend);
    for(int i = 1;i <= N; i++)
    {
        if(h[sor[i].cs]==0)
            Mely(sor[i].cs);
    }

    /*for(int i = 1;i <= N; i++)
    {
        cout << i << ":" << h[i] << "\n";
    }*/
    for(int a:kerd)
    {
        if(h[a]==1)
            cout << "A\n";
        else
            cout << "B\n";
    }
    return 0;
}