#include <bits/stdc++.h>
using namespace std;
const char nl = '\n';
long long dfs(long long node, long long parent, vector<long long> g[1001]) {
  long long ans = 0;
  for (long long child : g[node]) {
    if (child == parent) continue;
    ans += dfs(child, node, g);
  }
  return ans + 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    long long n, x;
    cin >> n >> x;
    vector<long long> g[n + 1];
    for (int i = 0; i < n - 1; i++) {
      long long z, y;
      cin >> z >> y;
      g[z].push_back(y);
      g[y].push_back(z);
    }
    if (g[x].size() <= 1)
      cout << "Ayush" << nl;
    else if (dfs(x, 0, g) % 2 == 0)
      cout << "Ayush" << nl;
    else
      cout << "Ashish" << nl;
  }
  return 0;
}
