#include<bits/stdc++.h>

using namespace std;

queue<int> q;

struct node

{

    int to,dis;

};

vector<node> v[];

int n,m,t1,t2,a[],vis[],pre[];

long long ans=,dis[];

int ans1,ans2;

int main()

{

    memset(dis,0x3f,sizeof(dis));

    scanf("%d%d",&n,&m);

    for (int i=;i<=m;i++)

    {

        int u,to,d;

        scanf("%d%d%d",&u,&to,&d);

        v[u].push_back((node){to,d});

        v[to].push_back((node){u,d});

    }

    scanf("%d",&t1);

    for (int i=;i<=t1;i++) scanf("%d",&a[i]);

    sort(a+,a+t1+);

    scanf("%d",&t2);

    int t;

    for (int i=;i<=t2;i++) scanf("%d",&t),pre[t]=t,vis[t]=,dis[t]=,q.push(t);

    while(!q.empty())

    {

        int now=q.front();q.pop();vis[now]=;

        for (int i=;i<v[now].size();i++)

        {

            int to=v[now][i].to;

            if (dis[to]>dis[now]+v[now][i].dis)

            {

                pre[to]=pre[now];

                dis[to]=dis[now]+v[now][i].dis;

                if (!vis[to]) vis[to]=,q.push(to);

             }

        }

    }

    for (int i=;i<=t1;i++)

        if (ans>dis[a[i]]) ans=dis[a[i]],ans1=a[i];

    printf("%ld %d %d",ans,ans1,pre[ans1]);

    return ;

}