#include <bits/stdc++.h>

using namespace std;
const int MAXN = 100002;

int main() {
    int  T, n, f[MAXN];
    long long int a[MAXN], ans;
    scanf("%d", &T);
    while(T--){
        scanf("%d", &n);
        f[0] = 0;
        for(int i = 1, y; i < n; i++){
            scanf("%d", &y);
            f[i] = f[y]+1;
        }
        for(int i = 0; i < n; i++) scanf("%I64d", &a[i]);
        ans = 0;
        for(int i = 1; i < n; i++){
            if(f[i]%2 == 1) ans ^= a[i];
        }
        if(ans == 0) printf("lose\n");
        else printf("win\n");
    }
    return 0;
}