#include <bits/stdc++.h>
using namespace std;
const int maxn = 1002;
vector<int> g[maxn];
int sub[maxn];
void dfs(int s, int par = 0) {
  sub[s] = 1;
  for (int ch : g[s]) {
    if (ch == par) continue;
    dfs(ch, s);
    sub[s] += sub[ch];
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int n, node;
    cin >> n >> node;
    for (int i = 0; i <= n; i++) {
      g[i].clear();
      sub[i] = 0;
    }
    for (int i = 0, x, y; i < n - 1; i++) {
      cin >> x >> y;
      g[x].push_back(y);
      g[y].push_back(x);
    }
    if (g[node].size() <= 1) {
      cout << "Ayush\n";
      continue;
    }
    dfs(node);
    if ((sub[node] - 1) & 1)
      cout << "Ayush\n";
    else
      cout << "Ashish\n";
  }
}
