#include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <cstring>
#include <string>
#include <string.h>
#include <cmath>
#include <math.h>
#include <algorithm>
using namespace std;

typedef long long ll;
#define mem(x,y) memset(x,y,sizeof(x))
#define lowbit(x) (x & (-x))

const int  N1=101000,MAX=10001000;

struct Tree{
        int l,r;
}tr[N1];

int value[N1],depth[N1];

void dfs(int id){
        for (int i=tr[id].l; i!=-1; i=tr[i].r){
                depth[i]=depth[id]+1;
                dfs(i);
        }
}

int main(){

        int t;
        scanf("%d",&t);

        while(t--){
                depth[0]=1;
                mem(tr,-1);

                int n;
                scanf("%d",&n);
                for (int i=1; i<n; i++){
                        int fa;
                        scanf("%d",&fa);
                        tr[i].r=tr[fa].l;
                        tr[fa].l=i;
                }
                for (int i=0; i<n; i++) scanf("%d",&value[i]);

                dfs(0);
                int sg=0;
                for (int i=0; i<n; i++)
                        if (depth[i] % 2 ==0) sg ^= value[i];

                if (sg) printf("win\n");
                else printf("lose\n");
        }

        return 0;
}