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

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

void dfs(int v) {
    for (int x : g[v]) {
        dep[x] = dep[v] + 1;
        dfs(x);
    }
    if (col[v]) cnt[dep[v]] ^= 1;
}

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 = *max_element(cnt, cnt + N);
    cout << (r ? "First" : "Second");
}