#include <bits/stdc++.h>
using namespace std;
int countnode(map<int, vector<int>> m, int x, int parent) {
  int count = 1;
  for (auto i : m[x]) {
    if (i != parent) count += countnode(m, i, x);
  }
  return count;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, x;
    cin >> n >> x;
    map<int, vector<int>> m;
    for (int i = 0; i < n - 1; i++) {
      int a, b;
      cin >> a >> b;
      m[a].push_back(b);
      m[b].push_back(a);
    }
    if (m[x].size() == 1 || m[x].size() == 0)
      cout << "Ayush" << endl;
    else {
      if (countnode(m, x, x) % 2 == 0)
        cout << "Ayush" << endl;
      else
        cout << "Ashish" << endl;
    }
  }
}
