#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a),_=(b);i<=_;++i)
#define per(i,a,b) for(int i=(a),_=(b);i>=_;--i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define size(x) int(x.size())
using namespace std;

typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ul;
typedef __int128 LL;
typedef __uint128_t UL;
typedef double db;
typedef vector<int> VI;

const int mod=998244353;
int inc(int x,int y){return x+=y-mod,x+=x>>31&mod;}
int dec(int x,int y){return x-=y,x+=x>>31&mod;}
int mul(int x,int y){return ul(x)*y%mod;}
int inc2(int &x,int y){return x+=y-mod,x+=x>>31&mod;}
int dec2(int &x,int y){return x-=y,x+=x>>31&mod;}
int mul2(int &x,int y){return x=ul(x)*y%mod;}
int qpow(int x,int y){int z=1;for(;y;y>>=1,x=mul(x,x))if(y&1)z=mul(x,z);return z;}

const int N=1e6+10;
int n,f[N],c[N],h[N],d[N];
vector<int> G[N];

void dfs(int u){
	for(int v:G[u]){
		dfs(v);
		h[u]=max(h[u],h[v]+1);
	}
}

int main(){
	scanf("%d",&n);
	rep(i,2,n)scanf("%d",&f[i]),G[f[i]].pb(i);
	rep(i,1,n)scanf("%d",&c[i]);
	dfs(1);
	rep(i,1,n)if(c[i])d[h[i]]^=1;
	rep(i,0,n-1)if(d[i])puts("First"),exit(0);
	puts("Second");
	exit(0);
}