#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, x, y, s = 0;
  scanf("%d%d", &n, &x);
  for (int i = (int)(1); i <= (int)(2 * (n - 1)); i++) {
    scanf("%d", &y);
    if (y == x) ++s;
  }
  if (s == 0 || s == 1)
    puts("Ayush");
  else
    puts(n & 1 ? "Ashish" : "Ayush");
}
int main() {
  int T;
  scanf("%d", &T);
  while (T--) solve();
}
