#include <stdio.h>
#include <stdlib.h>

int p,n;
int sou[10000], ve[10000], was[10000];
short *e,*f,*ce,*cf;
unsigned short c[10000000];

void dfs(int v, int delka)
{
  int i,w;
  c[delka] = n;
  was[v] = 1;
  for (i=0; i<sou[v]; i++) {
    w=ve[v]+i;
    if (!was[e[w]]) dfs(e[w], delka+ce[w]);
  }
}

int main(void)
{
  int a,b,d,cc,i,j;
  
  n=1;
  
  while (scanf(" %d", &p), p!=0) {
    e = (short*)malloc(2*sizeof(short)*p);
    ce = (short*)malloc(2*sizeof(short)*p);
    f = (short*)malloc(2*sizeof(short)*p);
    cf = (short*)malloc(2*sizeof(short)*p);
    
    for (i=0; i<p; i++) sou[i]=ve[i]=was[i]=0;
    
    for (a=0, d=0; a<p; ) {
      scanf(" %d", &b);
      if (b==0) {
        a++;
	continue;
      }
      b--;
      sou[a]++; sou[b]++;
      scanf(" %d", &cc);
      f[d*2]=a; f[d*2+1]=b;
      cf[d*2]=cc; cf[d*2+1]=cc;
      d++;
    }
    for (was[0]=ve[0]=0, i=1; i<p; i++) {
      ve[i]=ve[i-1]+sou[i-1];
      was[i]=was[i-1]+sou[i-1];
    }
        
    for (i=0; i<d; i++) {
      e[was[f[i*2]]] = f[i*2+1]; ce[was[f[i*2]]] = cf[i*2+1];
      was[f[i*2]]++;
      e[was[f[i*2+1]]] = f[i*2]; ce[was[f[i*2+1]]] = cf[i*2];
      was[f[i*2+1]]++;
    }
    free(f);
    free(cf);
    
    for (i=0; i<p; i++) {
      for (j=0; j<p; j++) was[j]=0;
      dfs(i,0);
    }
    
    while (scanf(" %d", &cc), cc!=0) {
      if (c[cc]==n) printf("AYE\n");
      else printf("NAY\n");
    }
    printf(".\n");

    free(e); 
    free(ce);   
    n++;
  }
  
  return 0;
}