#include <bits/stdc++.h>
using namespace ::std;
vector<long long int> graph[10000];
long long int marked[10000];
long long int totalCount = 0;
bool isSingle = false;
long long int coun = 0;
long long int dfs_util(long long int s, long long int dist) {
  marked[s] = 1;
  long long int i, j;
  long long int ans = 0;
  for (i = 0; i < graph[s].size(); i++) {
    j = graph[s][i];
    if (marked[j] == 0) ans = ans + dfs_util(j, dist + 1) + 1;
  }
  if (dist == 1) {
    totalCount += ans;
    coun++;
  }
  return ans;
}
void calculateDist(long long int n, long long int s) {
  long long int i, j, k;
  for (i = 0; i < n; i++) marked[i] = 0;
  dfs_util(s, 0);
}
void clearGraph() {
  long long int i, j, k;
  for (i = 0; i <= 1000; i++) graph[i].clear();
}
int main() {
  long long int i, j, k, n, t, x;
  cin >> t;
  while (t--) {
    cin >> n >> x;
    clearGraph();
    x--;
    for (i = 0; i < n - 1; i++) {
      cin >> j >> k;
      j--;
      k--;
      graph[j].push_back(k);
      graph[k].push_back(j);
    }
    totalCount = 0;
    coun = 0;
    calculateDist(n, x);
    if (graph[x].size() <= 1 || ((totalCount + coun) % 2 != 0))
      cout << "Ayush\n";
    else
      cout << "Ashish\n";
  }
  return 0;
}
