#include <bits/stdc++.h>   using namespace std;   using ll = long long;   const int N = 2e5 + 5;   const int mod = 998244353;   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);     ;     int t;     cin >> t;     while (t--) {       int n, x;       cin >> n >> x;       vector<int> g[n + 1];       for (int i = 1; i < n; i++) {         int u, v;         cin >> u >> v;         g[u].push_back(v);         g[v].push_back(u);       }       if (g[x].size() == 1) {         cout <<  Ayush n ;         continue;       }       vector<int> flag(n + 1);       for (int k : g[x]) {         flag[k] = 1;       }       int sz = g[x].size();       int cnt = 0;       for (int i = 1; i <= n; i++) {         if (i != x and flag[i] == 0) cnt++;       }       4;       int total = cnt + sz - 1;       if (total % 2 == 1) {         cout <<  Ashish n ;       } else         cout <<  Ayush n ;     }   }   