#include <bits/stdc++.h>

using namespace std;
const int N = 2e5 + 69;
vector<int> a;
map<int, vector<int>> th;
int ans = 0;
int dp[N];

int dijkstra(int root) {
    fill(dp, dp + N, 1e9);
    priority_queue<int, vector<int>, greater<>> pq;
    dp[root] = (a[root] == 1);
    pq.push(1);
    while (!pq.empty()) {
        int X = pq.top();
        pq.pop();
        for (auto i: th[X]) {
            if (dp[i] > dp[X] + (a[i] == 1)) {
                dp[i] = dp[X] + (a[i] == 1);
                pq.push(i);
            }
        }
    }
    for (auto i: dp)
        if (i != 1e9)
            ans = max(ans, i);
    return ans;
}

signed main() {
    int n;
    ans = INT_MIN;
    cin >> n;
    a = vector<int>(n + 33, 0);
    for (int i = 2; i <= n; i++) {
        int u;
        cin >> u;
        th[u].push_back(i);
        th[i].push_back(u);
    }
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
//    cout << dijkstra(1) << endl;
    cout << (dijkstra(1) % 2 == 0 ? "First" : "Second") << "\n";
}