#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#define X first
#define Y second
#define clr(u,v); memset(u,v,sizeof(u));
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=100000+10;
const int INF=0x3f3f3f3f;
vector <int> V[maxn];
ll c[maxn];
ll ans;
void dfs(int cur,bool k)
{
    if (k) ans^=c[cur];
    for (int i=0;i<V[cur].size();i++)
    {
        int v=V[cur][i];
        dfs(v,!k);
    }
}
int main()
{
    int T;
    scanf("%d",&T);
    while (T--)
    {

        int n,x;
        scanf("%d",&n);
        for (int i=0;i<=n;i++)
        V[i].clear();
        for (int i=1;i<n;i++)
        {
            scanf("%d",&x);
            V[x].push_back(i);
        }
        for (int i=0;i<n;i++)
            scanf("%I64d",&c[i]);
        ans=0;
        dfs(0,0);
        if (ans) puts("win");
        else puts("lose");
    }
    return 0;
}