#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
 
mt19937 rng((int) chrono::steady_clock::now().time_since_epoch().count());
    
const int MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;
const ll INF = 2e18;

int fl, qt;

vector <int> grafo[MAXN];
int marc[MAXN];

void dfs(int v) {
    if(marc[v] == 1) {
        qt++;
        if(grafo[v].size() == 0) fl++;
        return;
    }
    for(int viz : grafo[v]) {
        dfs(viz);
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    for(int i = 2; i <= n; i++) {
        int v;
        cin >> v;
        grafo[v].push_back(i);
    }
    for(int i = 1; i <= n; i++) cin >> marc[i];
    dfs(1);
    qt -= fl;
    if(qt == 0) {
        if(fl % 2 == 0) cout << "Second\n";
        else cout << "First\n";
    }
    else {
        if(qt % 2 == 0) cout << "Second\n";
        else cout << "First\n";
    }
    return 0;
}