#include <bits/stdc++.h>

using namespace std;
const int N = 2e5 + 69;
vector<int> G[N];
int h[N], col[N];
map<int, vector<int>> a;

void dfs(int root, int par) {
    h[root] = h[par] + 1;
    if (!col[root]) {
        a[h[root]].push_back(col[root]);
    }
    for (auto i: G[root]) {
        if (i == par)continue;
        dfs(i, root);
    }
}

signed main() {
    int n;
    cin >> n;
    for (int i = 2; i <= n; i++) {
        int u;
        cin >> u;
        G[u].push_back(i);
        G[i].push_back(u);
    }
    for (int i = 1; i <= n; i++) {
        cin >> col[i];
    }
    dfs(1, 0);
    bool flag = 0;
    for (auto i: a)
        flag |= (i.second.size() % 2);
    cout << (flag ? "First" : "Second") << endl;
}