#include <bits/stdc++.h>

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

bool state[100100] = {false};

vector<int> g[100100];

int main()
{
  int n, m, q;
  cin >> n >> m >> q;
  vector<int> start(q);
  for(auto& i : start){
    cin >> i;
  }
  vector<bool> isjapan(n + 1, true);
  while(m--){
    int p, w;
    cin >> p >> w;
    g[w].push_back(p);
    isjapan[p] = false;
  }
  queue<int> bfs;
  for(int i = 1; i <= n; ++i){
    if(isjapan[i]){
      bfs.push(i);
    }
  }
  while(!bfs.empty()){
    auto p = bfs.front();
    bfs.pop();
    for(auto i : g[p]){
      bfs.push(i);
      if(!state[p]){
        state[i] = true;
      }
    }
  }
  for(auto i : start){
    if(state[i])
      cout << "A" << endl;
    else
      cout << "B" << endl;
  }
  return 0;
}