#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
struct node {
  int x, y, id;
  bool operator<(const node& t) const { return x < t.x; }
} c[N];
bool cmp1(node& a, node& b) { return a.id < b.id; }
int a[N];
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    int n, x, u, v;
    scanf("%d%d", &n, &x);
    int e = 0;
    for (int i = 0; i < n - 1; ++i) {
      scanf("%d%d", &u, &v);
      if (u == x || v == x) {
        ++e;
      }
    }
    if (e == 1 || n == 1) {
      puts("Ayush");
    } else {
      int ans = (n - 1) - e;
      bool flag = 0;
      if (ans & 1)
        flag = 0;
      else
        flag = 1;
      if (e & 1) {
        if (flag)
          puts("Ayush");
        else
          puts("Ashish");
      } else {
        if (flag)
          puts("Ashish");
        else
          puts("Ayush");
      }
    }
  }
  return 0;
}
