#include <bits/stdc++.h>
using namespace std;
long long M = 1000000007;
long long power(long long x, long long y, long long m = M) {
  if (y == 0) return 1;
  long long p = power(x, y / 2LL, m) % m;
  p = (p * p) % m;
  return (y % 2LL == 0) ? p : (x * p) % m;
}
long long modInverse(long long a, long long m) { return power(a, m - 2LL, m); }
int gcd(int a, int b) {
  if (a < b) swap(a, b);
  while (b > 0) {
    int tmp = b;
    b = a % b;
    a = tmp;
  }
  return a;
}
void solve() {
  int n, x;
  cin >> n >> x;
  vector<vector<int>> g(n + 1);
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    cin >> a >> b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  int f = true;
  if (int((g[x]).size()) == 0 || int((g[x]).size()) == 1) {
    f = true;
  } else {
    if ((n - 3) % 2 == 0) {
      f = false;
    } else {
      f = true;
    }
  }
  if (f)
    cout << "Ayush\n";
  else
    cout << "Ashish\n";
}
void solveall() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
int main() {
  solveall();
  return 0;
}
