#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 2e5 + 5;
const long long MOD = 1e9 + 7;
const long long INF = INT64_MAX;
mt19937 rnd(time(0));
vector<long long> sz;
vector<vector<long long>> g;
void dfs(long long v, long long p) {
  sz[v] = 1;
  for (auto to : g[v]) {
    if (to == p) continue;
    dfs(to, v);
    sz[v] += sz[to];
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long q;
  cin >> q;
  while (q--) {
    long long n, x;
    cin >> n >> x;
    x--;
    sz.clear();
    g.clear();
    g.resize(n);
    sz.resize(n);
    for (long long i = 0; i < n - 1; ++i) {
      long long u, v;
      cin >> u >> v;
      u--;
      v--;
      g[u].push_back(v);
      g[v].push_back(u);
    }
    if (n <= 2) {
      cout << "Ayush\n";
      continue;
    }
    bool win1 = (n % 2 == 0);
    win1 |= (g[x].size() == 1);
    cout << (win1 ? "Ayush\n" : "Ashish\n");
  }
  return 0;
}
