#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 = 40;
vector<int> G[100005];
int clr[100005];
ll sg[100005][2];

void dfs(int u) {
    int cnt[C] = {};
    for (int i : G[u]) {
        dfs(i);
        sg[u][0] ^= sg[i][0];
        ll val = sg[i][1];
        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) sg[u][1] |= 1LL << i;
        else if (cnt[i] > 1) {
            sg[u][1] |= (1LL << (i + 1)) - 1;
            break;
        }
    }
    ++sg[u][1];
    if (clr[u] == 1)
        sg[u][0] += sg[u][1];
}

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);
    if (sg[1][0]) cout << "First\n";
    else cout << "Second\n";
}