#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T read(){
    T x=0;char ch=getchar();bool fl=false;
    while(!isdigit(ch)){if(ch=='-')fl=true;ch=getchar();}
    while(isdigit(ch)){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
    return fl?-x:x;
}
#define LL long long 
#define read() read<int>()
const int maxn = 1e5 + 10;
int head[maxn],cnt=0;
struct edge{
    int to,nxt;
}e[maxn<<1];
inline void link(int u,int v){
    e[++cnt].to=v;e[cnt].nxt=head[u];head[u]=cnt;
}
int deg[maxn],n,sz[maxn],son[maxn],son1[maxn];
void dfs(int u,int fa){
    if(deg[u]==1 && u!=1)sz[u]=1;
    for(int i=head[u];i;i=e[i].nxt){
        int v=e[i].to;
        if(v==fa)continue;
        dfs(v,u);
        sz[u]+=sz[v];
        if(sz[son[u]]<=sz[v])son1[u]=son[u],son[u]=v;
    }
}
inline bool solve(){
    if(!son[1])return false;
    if(son[1] && !son1[1])return true;
    int u=1;
    while(1){
        if(deg[u]==1)return true;
        if(!son1[u])return false;
        u=son1[u];
    }
}
int main(){
    n=read();
    for(int i=1;i<n;i++){
        int u=read(),v=read();
        link(u,v);link(v,u);
        deg[u]++;deg[v]++;
    }
    dfs(1,0);
    for(int i=1;i<=n;i++)cerr<<son[i]<<" "<<son1[i]<<endl;//
    bool fl=solve();
    puts(fl?"You win, temporarily.":"Wasted.");
    return 0;
}