#include <iostream>
#include <vector>
#include <cstdio>
#define ll long long
#define MAXN (ll) 1e5+5
using namespace std;

ll avail[MAXN];
vector<ll> v[MAXN];

void dfs(ll now = 1, ll fa = -1)
{
    ll nowavail = 0;
    for(auto &i : v[now])
    {
        if(i != fa)
        {
            dfs(i, now);
            nowavail += avail[i] > 1 || v[i].size() == 1;
        }
    }
    if(v[now].size() == 1)
        nowavail ++;
    avail[now] = nowavail;
}

void dfsans(ll now = 1, ll fa = -1)
{
    if(v[now].size() == 1)
    {
        cout << "You win, temporarily.";
        exit(0);
    }
    if(avail[now] <= 1)
        return;
    for(auto &i : v[now])
        if(i != fa)
            dfsans(i, now);
}

int main()
{
    ll n;
    scanf("%lld",&n);
    for(int i = 1; i < n; i++)
    {
        ll a, b;
        scanf("%lld%lld", &a, &b);
        v[a].push_back(b);
        v[b].push_back(a);
    }
    dfs();
    dfsans();
    cout << "Wasted.";
}