#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
template <class T>
inline void read(T &res) {
  char c;
  T flag = 1;
  while ((c = getchar()) < '0' || c > '9')
    if (c == '-') flag = -1;
  res = c - '0';
  while ((c = getchar()) >= '0' && c <= '9') res = res * 10 + c - '0';
  res *= flag;
}
const int N = 1005;
int t;
int n, x;
int u, v;
int deg[N];
int main() {
  scanf("%d", &t);
  while (t--) {
    memset(deg, 0, sizeof(deg));
    scanf("%d%d", &n, &x);
    for (int i = 0; i < n - 1; i++) {
      scanf("%d%d", &u, &v);
      deg[u]++;
      deg[v]++;
    }
    if (deg[x] <= 1) {
      printf("Ayush\n");
      continue;
    }
    if (n % 2 == 1) {
      printf("Ashish\n");
    } else {
      printf("Ayush\n");
    }
  }
  return 0;
}
