#include<bits/stdc++.h>
using namespace std;

#define int long long 
#define F first 
#define S second 
#define pb push_back
#define ld double
const int mol=998244353;

random_device rnd ;
mt19937_64 rng ( rnd () ) ;

int hav[100005];
vector<int>node[100005];
int dep[100005], a[100005], ans[100005];
void dfs(int v){
    for(int k:node[v]){
        dfs(k);
        dep[v]=max(dep[v], dep[k]+1);
        ans[v]^=ans[k];
    }
    if(a[v]) ans[v]^=(hav[dep[v]]);
}

void solve(){
    int n;
    cin>>n;
    for(int i=0;i<=n;i++){
        hav[i]=rnd();
    }
    for(int i=2;i<=n;i++){
        int g;
        cin>>g;
        node[g].pb(i);
    }
    for(int i=1;i<=n;i++) cin>>a[i];
    dfs(1);
    if(ans[1]) cout<<"First\n";
    else cout<<"Second\n";
}

signed main(){
    ios::sync_with_stdio(0);cin.tie(0);
    // int t;
    // cin>>t;
    // while(t--)
    solve();
    return 0;
}