PC 求助！谢谢。

#include<bits/stdc++.h>
using namespace std;
vector<int>tree[101132];
bool hx(int i){
    if(!tree[i].size())return true;
    if(tree[i].size()==1)return false;
    int cnt=0;
	for(int j=0;j<tree[i].size();++j){
		cnt+=hx(tree[i][j]);
	}
	return cnt>=2;
}
int main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        int u,v;
        cin>>u>>v;
        if(u>v)swap(u,v);
        tree[u].push_back(v);
    }
    cout<<(hx(1)?"You win, temporarily.":"Wasted.");
}