#include <bits/stdc++.h>
using namespace std;
const int mod = (int)1e9 + 7;
const int N = (int)3e5 + 123;
const long long inf = (long long)1e18 + 1;
const double pi = acos(-1.0);
const double eps = 1e-9;
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
int n, x, sz[N];
vector<int> g[N];
void dfs(int v, int pr = 0) {
  sz[v] = 1;
  for (auto to : g[v]) {
    if (to != pr) dfs(to, v), sz[v] += sz[to];
  }
}
inline void boost() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
}
inline void Solve() {
  cin >> n >> x;
  for (int i = 1; i <= n; i++) g[i].clear(), sz[i] = 0;
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  if ((int)g[x].size() == 1 || n == 1) {
    cout << "Ayush\n";
    return;
  }
  dfs(x);
  if (sz[x] & 1)
    cout << "Ashish\n";
  else
    cout << "Ayush\n";
}
signed main() {
  boost();
  int tt = 1;
  cin >> tt;
  while (tt--) {
    Solve();
  }
  return 0;
}
