#include<iostream>
#include<cstdio>
#include<algorithm>
#define ll long long
using namespace std;
const int M=200010,N=200010;
struct edge
{
    int u,v,w;
}edg[M];
int n,m,f[N],s,st[N],top,hd[N],nt[N],e[N],w[N],idx=1,res;
ll mst;
bool vis[N];
void add(int u,int v,int k)
{
    nt[++idx]=hd[u],hd[u]=idx,e[idx]=v,w[idx]=k;
    nt[++idx]=hd[v],hd[v]=idx,e[idx]=u,w[idx]=k;
}
bool cmp1(edge a,edge b)
{
    return a.w<b.w;
}
int find(int x)
{
    if(x==f[x]) return x;
    return f[x]=find(f[x]);
}
bool DFS(int nw,int cur,int fa)
{
    if(vis[nw])//finish
    {
        int ed=e[st[cur]];
        res=w[st[cur]];
        int num=cur-1;
        while(num&&e[st[num]]!=ed)
        {
            res=max(res,w[st[num]]);
            --num;
        }
        return 1;
    }
    vis[nw]=1;
    for(int i=hd[nw];i;i=nt[i])
        if(e[i]!=fa)
        {
            st[cur+1]=i;
            if(DFS(e[i],cur+1,nw)) return 1;
        }
    return 0;
}
int main()
{
    freopen("zxscs.in","r",stdin);
    freopen("zxscs.out","w",stdout);
    int cnt=0;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;++i) scanf("%d%d%d",&edg[i].u,&edg[i].v,&edg[i].w);
    scanf("%d",&s);
    for(int i=1;i<=n;++i) f[i]=i;
    sort(edg+1,edg+1+m,cmp1);
    for(int i=2;i<=m;++i)
    {
        if(find(edg[i].u)!=find(edg[i].v))
        {
            ++cnt;
            f[find(edg[i].u)]=find(edg[i].v);
            add(edg[i].u,edg[i].v,edg[i].w);
            mst+=edg[i].w;
        }
        if(cnt==n-1) break;
    }
    if(s>=mst)
    {
        printf("Poor van!\n");
        return 0;
    }
    add(edg[1].u,edg[1].v,-1);
    for(int i=1;i<=n;++i)
        if(i!=edg[1].u&&i!=edg[1].v)
        {
            DFS(1,0,0);
            break;
        }
    if(res>mst-s)
    {
        printf("%lld\n",res-mst+s);
        return 0;
    }
    printf("Poor van!\n");
    return 0;
}