#include <bits/stdc++.h>

using namespace std;
using ll = long long int;
const ll inf = 1e9;

bool state[100100] = {false};
bool done[100100] = {false};
vector<int> g[100100];

void dfs(int node){
  if(done[node]) return;
  done[node] = true;
  for(auto i : g[node]){
    dfs(i);
    if(!state[i])
      state[node] = true;
  }
}

int main()
{
  int n, m, q;
  cin >> n >> m >> q;
  vector<int> start(q);
  for(auto& i : start){
    cin >> i;
  }
  while(m--){
    int p, w;
    cin >> p >> w;
    g[p].push_back(w);
  }
  for(int i = 1; i <= n; ++i){
    if(!done[i]){
      dfs(i);
    }
  }
  for(auto i : start){
    if(state[i])
      cout << "A" << endl;
    else
      cout << "B" << endl;
  }
  return 0;
}