#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
using namespace std;
const long long mod = 1e9 + 7;
const long long N = 1e6 + 6;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long pow(long long a, long long b) {
  long long ans = 1;
  while (b > 0) {
    if (b & 1) ans = (ans * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return ans;
}
long long readn() {
  long long sum = 0, f = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    sum = sum * 10 + (ch - '0');
    ch = getchar();
  }
  return sum * f;
}
long long _, n, x, du[1005];
vector<long long> G[1005];
int main() {
  cin >> _;
  while (_--) {
    cin >> n >> x;
    memset(du, 0, sizeof(du));
    for (long long i = 1; i <= n; i++) {
      G[i].clear();
    }
    for (long long i = 2; i <= n; i++) {
      long long a = readn(), b = readn();
      G[a].push_back(b);
      G[b].push_back(a);
      du[a]++;
      du[b]++;
    }
    if (n == 1) {
      puts("Ayush");
      continue;
    }
    if (du[x] == 1) {
      puts("Ayush");
      continue;
    } else {
      long long ans = n - 2;
      if (!(ans % 2))
        puts("Ayush");
      else
        puts("Ashish");
    }
  }
}
