#include <bits/stdc++.h>
#pragma GCC optimize(2)
const int mod = 10007;
const long long INF = 1e18;
const int maxn = 1e6 + 10;
using namespace std;
long long max(long long a, long long b) { return a > b ? a : b; }
long long min(long long a, long long b) { return a < b ? a : b; }
long long loop(long long n, long long p) { return (n % p + p) % p; }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL), cout.tie(NULL);
  int T;
  cin >> T;
  while (T--) {
    int n, x;
    cin >> n >> x;
    int cnt = 0;
    n--;
    for (int i = 1; i <= n; i++) {
      int u, v;
      cin >> u >> v;
      if (u == x) cnt++;
      if (v == x) cnt++;
    }
    if (cnt == 1 || n == 0) {
      cout << "Ayush" << endl;
    } else if (n & 1) {
      cout << "Ayush" << endl;
    } else
      cout << "Ashish" << endl;
  }
  return 0;
}
