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

const int N = 101010;
int n, col[N], dp[N];
vector<int> g[N];

void dfs(int v) {
    priority_queue<int> q;
    for (int x : g[v]) {
        dfs(x);
        q.push(dp[x]);
    }
    if (q.empty()) return;
    for (int i = 30; i >= 0; i--) {
        if (!q.empty() && q.top() >> i & 1) {
            int x = q.top(); q.pop();
            q.push(x - (1 << i));
            dp[v] |= (1 << i);
        }
    }
    ++dp[v];
}
int solve(int v) {
    if (col[v]) return dp[v];
    int res = 0;
    for (int x : g[v]) {
        res ^= solve(x);
    }
    return res;
}
int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    cin >> n;
    for (int i = 2; i <= n; i++) {
        int x; cin >> x;
        g[x].push_back(i);
    }
    for (int i = 1; i <= n; i++) {
        cin >> col[i];
    }
    dfs(1);
    int r = solve(1);
    cout << (r ? "First" : "Second");
}