{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\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 type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e\u003cb\u003eLa inceput\u003c/b\u003e avem un arbore cu $$$N$$$ noduri.\u003c/p\u003e\n\n\u003cp\u003e\u003cb\u003eAvem $$$Q$$$ query-uri de efectuat\u003c/b\u003e. Fiecare query contine $$$5$$$ numere intregi: $$$x$$$, $$$y$$$, $$$a$$$, $$$b$$$, and $$$k$$$. Pentru astfel de query, trebuie aflat daca exista un lant de la $$$a$$$ la $$$b$$$ ce contine exact $$$k$$$ muchii dupa ce am adauga o muchie de la $$$x$$$ la $$$y$$$. \u003cspan class\u003d\"tex-font-style-bf\"\u003eLantul poate contine aceleasi noduri sau muchii de mai multe ori\u003c/span\u003e. Toate query-urile sunt independente; i.e. muchia de la $$$x$$$ la $$$y$$$ este eliminata cand consideram urmatorul query.\u003c/p\u003e\n\n\u003cp\u003e\u003cb\u003eLa sfarsit\u003c/b\u003e trebuie sa fie afisate $$$Q$$$ raspunsuri de tip $$$YES$$$ sau $$$NO$$$. "}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003ePrima linie contine $$$N$$$ ($$$3 \\le N \\le 10^5$$$), numarul de noduri.\u003c/p\u003e\n\u003cp\u003eUrmatoarele $$$N-1$$$ linii contin cate doua numere intregi $$$u$$$ si $$$v$$$ ($$$1 \\le u,v \\le n$$$, $$$u \\ne v$$$), reprezentand faptul ca exista muchie de la $$$u$$$ la $$$v$$$. Toate muchiile sunt neorientate si distincte.\u003c/p\u003e\n\u003cp\u003eUrmatoarea linie are un numar intreg $$$Q$$$ ($$$1 \\le Q \\le 10^5$$$), numarul de query-uri.\u003c/p\u003e\n\u003cp\u003eUrmatoarele $$$Q$$$ linii contin cate 5 numere intregi $$$x$$$, $$$y$$$, $$$a$$$, $$$b$$$, si $$$k$$$ ($$$1 \\le x,y,a,b \\le n$$$, $$$x \\ne y$$$, $$$1 \\le k \\le 10^9$$$) - informatiile query-ului. Este garantat ca muchia dintre $$$x$$$ si $$$y$$$ nu exista in arborele original.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003ePentru fiecare query, afisati \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eYES\u003c/span\u003e\" daca exista un lant format din $$$k$$$ muchii de la nodul $$$a$$$ la nodul $$$b$$$ dupa ce adaugam o muchie de la nodul $$$x$$$ la nodul $$$y$$$. Altfel, afisati \"\u003cspan class\u003d\"tex-font-style-tt\"\u003eNO\u003c/span\u003e\".\u003c/p\u003e"}},{"title":"Sample 1","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\u003e5\n1 2\n2 3\n3 4\n4 5\n5\n1 3 1 2 2\n1 4 1 3 2\n1 4 1 3 3\n4 2 3 3 9\n5 2 3 3 9\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eYES\nYES\nNO\nYES\nNO\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}