#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
const int sz = 111111;
vector<pi>tree[sz+5];
bool v[sz+5],cabin[sz+5];
int fenwick[sz+5],sub[sz+5];
ll dist[sz+5];
ll D,paths;
vector<ll>vals;
vector<int>tmp;
void init(int i){
while(i<=vals.size()-1){
fenwick[i] = 0;
i+=(i&-i);
}
}
void update(int i,int val){
while(i<=vals.size()-1){
fenwick[i]+=val;
i+=(i&-i);
}
}
int sum(int i){
int r = 0;
while(i){
r+=fenwick[i];
i-=(i&-i);
}
return r;
}
void DFS(int cur,int par){
if(cabin[cur]) vals.emplace_back(dist[cur]);
for(pi p : tree[cur]){
int nxt = p.first,w = p.second;
if(nxt == par || v[nxt]) continue;
dist[nxt] = dist[cur] + w;
DFS(nxt,cur);
}
}
void DFS2(int cur,int par){
if(cabin[cur]){
int id = (int)(lower_bound(vals.begin(),vals.end(),dist[cur])-vals.begin());
tmp.emplace_back(id);
int lim = D - dist[cur];
if(dist[cur] <= D){
int ID = (int)(upper_bound(vals.begin(),vals.end(),D-dist[cur])-vals.begin());
paths+=sum(ID-1);
}
}
for(pi p : tree[cur]){
int nxt = p.first,w = p.second;
if(v[nxt] || nxt == par) continue;
DFS2(nxt,cur);
}
}
void dfs(int cur,int par){
sub[cur] = 1;
for(pi p : tree[cur]){
int nxt = p.first,w = p.second;
if(v[nxt] || nxt == par) continue;
dfs(nxt,cur);
sub[cur] += sub[nxt];
}
}
void decomposition(int cent){
dfs(cent,0);
int tot = sub[cent];
while(1){
int child = -1;
for(pi p : tree[cent]){
int nxt = p.first;
if(v[nxt] || sub[nxt] > sub[cent]) continue;
if(child == -1 || sub[child] < sub[nxt])
child = nxt;
}
if(child != -1 && sub[child]*2 > tot) cent = child;
else break;
}
vals = {-1}; dist[cent] = 0;
DFS(cent,0);
sort(vals.begin(),vals.end());
vals.erase(unique(vals.begin(),vals.end()),vals.end());
if(cabin[cent]) update(1,1);
for(pi p : tree[cent]){
int nxt = p.first,w = p.second;
if(v[nxt]) continue;
tmp.clear();
DFS2(nxt,cent);
for(int x : tmp) update(x,1);
}
for(int i=1; i<=vals.size(); i++) init(i);
v[cent] = 1;
for(pi p : tree[cent]){
int nxt = p.first;
if(v[nxt]) continue;
decomposition(nxt);
}
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
ll n,m,k; cin>>n>>m>>k;
for(int i=2; i<=n; i++){
ll p,d; cin>>p>>d;
assert(d<=1e9+7);
tree[p].emplace_back(pi(i,d));
tree[i].emplace_back(pi(p,d));
}
for(int i=1; i<=m; i++){
int x; cin>>x;
cabin[x] = 1;
}
ll l = 1,r = n*(1e9);
while(l<=r){
m = (l+r)>>1;
for(int i=1; i<=n; i++) v[i] = fenwick[i] = 0;
D = m; paths = 0;
decomposition(1);
if(paths < k) l = m+1;
else r = m-1;
}
cout<<l;
}
