#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int> adj[1005];
int sz[1005];
void dfs(int node, int par) {
  sz[node] = int(adj[node].size()) - 1;
  for (auto it : adj[node]) {
    if (it != par) {
      dfs(it, node);
      sz[node] += sz[it];
    }
  }
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int tests = 1;
  cin >> tests;
  for (int test = 1; test <= tests; ++test) {
    int n, x;
    cin >> n >> x;
    memset(sz, 0, sizeof(sz));
    for (int i = 1; i <= n; ++i) adj[i].clear();
    for (int i = 1; i <= n - 1; ++i) {
      int r1, r2;
      cin >> r1 >> r2;
      adj[r1].push_back(r2);
      adj[r2].push_back(r1);
    }
    if ((int(adj[x].size()) == 1) || (n == 1)) {
      cout << "Ayush\n";
      continue;
    }
    dfs(x, x);
    int sum = 0;
    for (auto it : adj[x]) sum += sz[it];
    sum += (int(adj[x].size()) - 1);
    if (sum & 1) {
      cout << "Ashish\n";
    } else
      cout << "Ayush\n";
  }
  return 0;
}
