#include <bits/stdc++.h>
using namespace std;
void __print(unsigned x) { cerr << x; }
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
void __print(char x) { cerr << '\'' << x << '\''; }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
int n, x;
vector<int> visited;
vector<int> g[20000];
void dfs(int u, int deep) {
  visited[u] = deep;
  for (int v : g[u]) {
    if (!visited[v]) {
      dfs(v, deep + 1);
    }
  }
}
void solve() {
  cin >> n >> x;
  x--;
  for (int i = 0; i < n; i += 1) g[i].clear();
  visited.clear();
  visited.resize(n);
  int e = n - 1;
  while (e--) {
    int u, v;
    cin >> u >> v;
    u--;
    v--;
    g[u].emplace_back(v);
    g[v].emplace_back(u);
  };
  if (g[x].size() <= 1) {
    cout << "Ayush\n";
    return;
  }
  int ans = 0;
  dfs(x, 1);
  for (int &x : visited) x--;
  vector<int> dis = visited;
  sort(dis.begin(), dis.end());
  ans = dis[n - 1] + dis[n - 2];
  int t = n - ans - 1;
  if (ans & 1) {
    if (t & 1) {
      cout << "Ashish\n";
    } else
      cout << "Ayush\n";
  } else {
    if (t & 1)
      cout << "Ayush\n";
    else
      cout << "Ashish\n";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int tc;
  cin >> tc;
  while (tc--) solve();
  return 0;
}
