#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, x;
    cin >> n >> x;
    vector<int> adj[n + 1];
    for (int i = 0; i < n - 1; i++) {
      int u, v;
      cin >> u >> v;
      adj[u].push_back(v);
      adj[v].push_back(u);
    }
    int level[n + 1];
    bool vis[n + 1];
    for (int i = 1; i <= n; i++) vis[i] = false;
    level[x] = 0;
    queue<int> q;
    q.push(x);
    vis[x] = true;
    while (!q.empty()) {
      int temp = q.front();
      q.pop();
      for (int i = 0; i < adj[temp].size(); i++) {
        if (vis[adj[temp][i]] == false) {
          q.push(adj[temp][i]);
          level[adj[temp][i]] = level[temp] + 1;
          vis[adj[temp][i]] = true;
        }
      }
    }
    if (adj[x].size() == 1 || adj[x].size() == 0) {
      cout << "Ayush" << endl;
      continue;
    }
    map<int, int> mp;
    for (int i = 1; i <= n; i++) mp[level[i]]++;
    int turn = 0;
    for (auto itr = mp.rbegin(); itr != mp.rend(); itr++) {
      if (itr->first == 1) {
        if ((itr->second) % 2 == 0) turn = 1 - turn;
        break;
      } else {
        if ((itr->second) % 2 != 0) turn = 1 - turn;
      }
    }
    if (turn == 0)
      cout << "Ayush" << endl;
    else
      cout << "Ashish" << endl;
  }
}
