#include <bits/stdc++.h>
const int maxn = 1e3 + 5;
using namespace std;
int n, x;
int u, v, du[maxn];
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    scanf("%d %d", &n, &x);
    for (int i = 1; i < n; i++) {
      scanf("%d %d", &u, &v);
      du[u]++;
      du[v]++;
    }
    if (du[x] <= 1)
      printf("Ayush\n");
    else {
      if ((n - 1) % 2)
        printf("Ayush\n");
      else
        printf("Ashish\n");
    }
    for (int i = 1; i <= n; i++) du[i] = 0;
  }
  return 0;
}
