题解 | 小红的树上游戏

#include<bits/stdc++.h>
using namespace std;

const int N=1e4+10;

int degree[N],n,x; 

void solve(){
	memset(degree,0,sizeof(degree));
	
	cin>>n>>x;
	
	int a,b;
	for(int i=1;i<=n-1;i++){
		cin>>a>>b;
		degree[a]++;
		degree[b]++;
	}
	
	if(degree[x]<=1){
		cout<<"win"<<endl;
		return;
	}
	
	if((n-2)%2==0){
		cout<<"win"<<endl;
	}else{
		cout<<"lose"<<endl;
	}
	
	return;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int t;
	cin>>t;
	
	while(t--){
		
		solve();
		
	}

    return 0;
}