#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>using namespace std;typedef long long ll;const int N=1e5+5;inline int read(){    char c=getchar();int x=0,f=1;    while(c<‘0‘||c>‘9‘){if(c==‘-‘)f=-1;c=getchar();}    while(c>=‘0‘&&c<=‘9‘){x=x*10+c-‘0‘;c=getchar();}    return x*f;}int n,m;struct edge{int v,ne;}e[N<<1];int cnt=1,h[N];inline void ins(int u,int v){    e[++cnt]=(edge){v,h[u]};h[u]=cnt;}int deep[N];void dfs(int u){    for(int i=h[u];i;i=e[i].ne)        deep[e[i].v]=deep[u]+1,dfs(e[i].v);}int main(){    freopen("in","r",stdin);    int T=read();    while(T--){        n=read();        cnt=0;memset(h,0,sizeof(h));        for(int i=2;i<=n;i++) ins(read()+1,i);        dfs(1);         int sg=0,a;        for(int i=1;i<=n;i++) a=read(),sg^=deep[i]&1 ? a : 0;        puts(sg ? "win" : "lose");    }}