{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eKangaroo Splay and General Kangaroo are playing a game called \"War Game\". In this game, Kangaroo Splay is the attacker and General Kangaroo is the defender.\u003cbr\u003e\u003cbr\u003eThe game map can be abstracted as a tree with $n$ nodes. Initially, the defender\u0027s character is at node $s$.\u003cbr\u003e\u003cbr\u003eThe game will proceed for $10^{100}$ rounds, and in each round, the process is as follows:\u003cbr\u003e\u003cbr\u003eFirst, the attacker will choose a node $p$ as the bombing center and give a \"bombing warning\" to the defender. If at the end of the round, the distance between the defender\u0027s node $t$ and the bombing center $p$ is **not greater than** the bombing radius $r_1$, then the defender\u0027s character will be blown up, and the game ends with the attacker winning. After that, the defender can move their character to a node that is **not greater than** $r_2$ distance from the current position, and then the round ends. If the defender\u0027s character is not blown up at the end of the round, the next round will continue until the rounds are exhausted. If the rounds are exhausted and the defender\u0027s character is still alive, then the defender wins, and the game ends.\u003cbr\u003e\u003cbr\u003eAs elites among kangaroos, both Kangaroo Splay and General Kangaroo are extremely intelligent (i.e., their actions are the optimal actions under the current situation). So, who will win at the end of the game?\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line contains an integer $T$, indicating the number of test cases. $(1 \\leq T \\leq 10^3)$\u003cbr\u003e\u003cbr\u003eFor each test case, the first line contains four integers $n$, $s$, $r_1$, $r_2$. $(1 \\leq n \\leq 10^5,1 \\leq s,r_1,r_2 \\leq n)$\u003cbr\u003e\u003cbr\u003eThen $(n-1)$ lines follow, each containing two integers $u_i$, $v_i$, representing an edge that exists in the tree. $(1 \\leq u_i,v_i \\leq n)$\u003cbr\u003e\u003cbr\u003eThe data guarantees $ \\sum n \\leq 2 \\times 10^6 $."}},{"title":"Output","value":{"format":"HTML","content":"For each test case, if Kangaroo Splay wins, output a line with the string `Kangaroo_Splay`; otherwise, output a line with the string `General_Kangaroo`. Each test case\u0027s answer should be separated by a newline."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\r\n5 3 2 3\r\n1 2\r\n2 3\r\n3 4\r\n3 5\r\n5 1 1 3\r\n1 2\r\n2 3\r\n3 4\r\n3 5\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eKangaroo_Splay\r\nGeneral_Kangaroo\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e"}}]}