#include <bits/stdc++.h>
using namespace std;
bool isPrime(int x) {
  if (x <= 1) return false;
  if (x <= 3) return true;
  if (x % 2 == 0 || x % 3 == 0) return false;
  for (long long int i = 5; i * i <= x; i += 6) {
    if (x % i == 0 || x % (i + 2) == 0) return false;
  }
  return true;
}
long long int nextPrime(int x) {
  if (x <= 1) return 2;
  while (!isPrime(x)) {
    x++;
  }
  return x;
}
int gcd(int a, int b) {
  while (a != 0) {
    int temp = a;
    a = b % a;
    b = temp;
  }
  return b;
}
long long int myceil(long long int a, long long int b) {
  return a / b + (a % b != 0);
}
long long int logabaseb(long long int a, long long int b) {
  long long int i = 1;
  long long int ans = 0;
  while (true) {
    if (i > a) {
      ans--;
      break;
    }
    if (i == a) break;
    i *= b;
    ans++;
  }
  return ans;
}
vector<int> adj[1005];
bool vis[1005];
int dist[1005];
bool solve(int n, int turn) {
  if (n == 2) {
    if (turn == 1)
      return 1;
    else
      return 0;
  }
  return solve(n - 1, (turn ^ 1));
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, x;
    cin >> n >> x;
    for (int i = 1; i <= n; i++) {
      vis[i] = false;
      dist[i] = 0;
      adj[i].clear();
    }
    for (int i = 0; i < n - 1; i++) {
      int u, v;
      cin >> u >> v;
      adj[u].push_back(v);
      adj[v].push_back(u);
    }
    if (n == 1 || adj[x].size() == 1) {
      cout << "Ayush\n";
      continue;
    }
    if (solve(n, 1))
      cout << "Ayush\n";
    else
      cout << "Ashish\n";
  }
  return 0;
}
