#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()
#define pb push_back

const int C = 20;
vector<int> G[100005];
int clr[100005], white[100005];

void dfs(int u) {
    if (clr[u] == 1) ++white[u];
    for (int i : G[u])
        dfs(i), white[u] += white[i];
}

int sg(int u, int c) {
    int res = 0, add = 0;
    if (c == 1) {
        if (clr[u] == 0)
            for (int i : G[u])
                res ^= sg(i, c);
        else
            c = 0, add = white[u] - 1;
    }
    if (c == 0) {
        int cnt[C] = {};
        for (int i : G[u]) {
            int val = sg(i, c);
            for (int j = 0; j < C; ++j)
                if (val >> j & 1)
                    ++cnt[j];
        }
        for (int i = C - 1; i >= 0; --i) {
            if (cnt[i] == 1) res |= 1 << i;
            else if (cnt[i] > 1) {
                res |= (1 << (i + 1)) - 1;
                break;
            }
        }
        ++res;
    }
    return res + add;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;
    for (int i = 2; i <= n; ++i) {
        int p;
        cin >> p;
        G[p].pb(i);
    }
    for (int i = 1; i <= n; ++i)
        cin >> clr[i];
    dfs(1);
    int res = sg(1, 1);
    if (res) cout << "First\n";
    else cout << "Second\n";
}