#include <bits/stdc++.h>
using namespace std;
const int N = 1005, mod = 1000000007;
int t;
int n, x, a, b;
vector<int> G[N];
bool vs[N];
int edg[N];
int s;
void DFS(int u) {
  vs[u] = true;
  for (int v : G[u])
    if (!vs[v]) {
      edg[u]++;
      DFS(v);
    }
  s += edg[u];
  return;
}
int main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio();
  cin >> t;
  while (t--) {
    cin >> n >> x;
    for (int i = 0; i <= n; i++) G[i].clear();
    for (int i = 0; i <= n; i++) {
      vs[i] = false;
      edg[i] = 0;
      s = 0;
    }
    for (int i = 1; i < n; i++) {
      cin >> a >> b;
      G[a].push_back(b);
      G[b].push_back(a);
    }
    DFS(x);
    if (n == 1 || edg[x] <= 1) {
      cout << "Ayush";
      cout << "\n";
    } else {
      s = n - edg[x] - 1;
      s %= 2;
      int r = edg[x] - 1;
      r %= 2;
      s += r;
      s %= 2;
      if (s == 1)
        cout << "Ashish";
      else
        cout << "Ayush";
      cout << "\n";
    }
  }
  return 0;
}
