#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>

using namespace std;

typedef long long LL;

int T,n,x;
vector<int> g[100005];
int a[100005],ans;
void dfs(int x,int d)
{
    if (d%2==1) ans^=a[x];
    for (int i=0;i<g[x].size();++i)
    {
        int y=g[x][i];
        dfs(y,d+1);
    }
}
int main()
{    
    scanf("%d",&T);
    while (T--)
    {
        scanf("%d",&n);
        for (int i=0;i<=n;++i) g[i].clear();
        for (int i=1;i<n;++i) 
        {
            scanf("%d",&x);
            g[x].push_back(i);
        }
        for (int i=0;i<n;++i) scanf("%d",&a[i]);
        ans=0;
        dfs(0,0);
        if (ans==0) printf("lose\n");
        else printf("win\n");
    }
    return 0;
}