#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;

vector<int> v[MAXN];
int cor[MAXN], dep[MAXN], qtd[MAXN];

int calcDep(int node) {
    for (int x : v[node]) {
        dep[node] = max(dep[node], calcDep(x) + 1);
    }
    return dep[node];
}

int calcQtd(int node) {
    qtd[node] = cor[node];
    for (int x : v[node]) {
        qtd[node] += calcQtd(x);
    }
    return qtd[node];
}

int dfs(int node) {
    if (cor[node]) {
        // branco
        return dep[node] + qtd[node];
    }
    else {
        // preto
        int ans = 0;
        for (int x : v[node]) {
            ans ^= dfs(x);
        }
        return ans;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    for (int i = 2; i <= n; i++) {
        int p;
        cin >> p;
        v[p].push_back(i);
    }
    for (int i = 1; i <= n; i++) {
        cin >> cor[i];
    }
    calcDep(1);
    calcQtd(1);
    cout << (dfs(1) ? "First\n" : "Second\n");
    return 0;
}