#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using dl = double;
using ld = long double;
using ull = unsigned long long;
const long N = 3e5 + 10;
ll aarray[N];
ll magic[510][510];
vector<ll> primes;
bool check[1000001];
ll vis[N];
map<ll, ll> mp;
void solve() {
  ll i, j, k, m, n, l, r, q, ans, sum = 0;
  string str;
  bool yes = true;
  vector<ll> v;
  cin >> n >> k;
  m = 0;
  for (i = 1; i < n; i++) {
    cin >> l >> r;
    mp[l]++;
    mp[r]++;
    m = max(m, mp[l]);
    m = max(m, mp[r]);
  }
  if (mp[k] > 1 && n % 2 && n != 1) {
    cout << "Ashish"
         << "\n";
  } else
    cout << "Ayush"
         << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  string str;
  ll i, j, n, m, k, t;
  cin >> t;
  while (t--) {
    mp.clear();
    solve();
  }
  return 0;
}
