#include <stdio.h>

#define MAX_N 10005

int e[MAX_N];
int s[MAX_N];
int c[MAX_N];
int E[2*MAX_N];
int S[2*MAX_N];
int C[2*MAX_N];

int vis[MAX_N];
int vis_flag;

char have[10000005];
int N;
short time=1;

void search(int v,int price) {
  int i;

  vis[v]=vis_flag;
  if (price>10000000) return;
  have[price]=time;

  for (i=E[v];i<E[v+1];i++) if (vis[S[i]]!=vis_flag) search(S[i],price+C[i]);
}

int main(void) {
  int i,j,A,B;
  while (scanf("%d",&N),N) {
    int sum=0;
    for (i=0;i<N;i++) {
      e[i]=sum;
      while (scanf("%d",&A),A) {
	A--;
	scanf("%d",&B);
	s[sum]=A;
	c[sum]=B;
	sum++;

	E[i]++;
	E[A]++;
      }
    }
    e[i]=sum;

    
    for (i=1;i<=N;i++) E[i]+=E[i-1];
    for (i=0;i<N;i++) {
      for (j=e[i];j<e[i+1];j++) {
	E[i]--;
	S[E[i]]=s[j];
	C[E[i]]=c[j];
	E[s[j]]--;
	S[E[s[j]]]=i;
	C[E[s[j]]]=c[j];
      }
    }

    for (i=0;i<N;i++) vis[i]=0;
    for (i=0;i<N;i++) {
      vis_flag=i+1;
      search(i,0);
    }

    while (scanf("%d",&A),A) {
      if (have[A]==time) puts("AYE");
      else puts("NAY");
    }

    time++;						       
  }
  return 0;
}