#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 7;
const int mod = 1e9 + 7;
std::vector<int> v[1005];
int a[1005];
int d[1005];
int dfs(int k, int f) {
  int len = v[k].size();
  for (int i = 0; i < len; i++) {
    if (v[k][i] == f)
      continue;
    else if (d[v[k][i]] == 1)
      return 1;
    else
      a[k] = a[k] ^ dfs(v[k][i], k);
  }
  return a[k];
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    for (int i = 0; i < 1000; i++) {
      v[i].clear();
      a[i] = 0;
      d[i] = 0;
    }
    int n, x;
    cin >> n >> x;
    for (int i = 0; i < n - 1; i++) {
      int x, y;
      cin >> x >> y;
      v[x].push_back(y);
      v[y].push_back(x);
      d[x]++;
      d[y]++;
    }
    if (n == 1 || d[x] == 1) {
      cout << "Ayush" << endl;
      continue;
    }
    if (n % 2)
      cout << "Ashish" << endl;
    else
      cout << "Ayush" << endl;
  }
  return 0;
}
