#include <bits/stdc++.h>
using namespace std;
#define fastio (ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL))
typedef long long ll;
typedef long double lld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int MAXSIZE = 2000000;
const long long INF = 1e18 + 5;
const double EPSILON = 1e-14;
const ll DIV = 2000003;
const long double pi = 3.14159265358979323846264338327950288419716939937510L;

int n;
int tg[101001];
int cnt[101010];
vector<int> adj[101010];

int dfs(int cur)
{

    int ret = 0;
    cnt[cur] = 1;
    for (int nxt : adj[cur])
    {
        ret ^= dfs(nxt);
        cnt[cur] += cnt[nxt];
    }
    if (tg[cur])
        ret ^= cnt[cur];
    return ret;
}

int dfs2(int cur)
{
    if (tg[cur])
        return cnt[cur];
    int ret = 0;
    for (int nxt : adj[cur])
    {
        ret ^= dfs2(nxt);
    }
    return ret;
}

int main()
{
    fastio;
    cin >> n;
    for (int i = 2; i <= n; i++)
    {
        int a;
        cin >> a;
        adj[a].push_back(i);
    }
    for (int i = 1; i <= n; i++)
        cin >> tg[i];

    int t = dfs(1);
    t = dfs2(1);
    if (t)
        cout << "First";
    else
        cout << "Second";
    return 0;
}