#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,m,x,y,z,d[25][25],q,k,r,s,dis[25][(1 << 21) + 5],dp[(1 << 21) + 5],ans[(1 << 21) + 5],yc[(1 << 21) + 5];
int main()
{
	scanf("%lld%lld",&n,&m);
	for(ll i = 1;i <= n;i++)
	    yc[(1 << (i - 1))] = i;
	for(ll i = 1;i <= n;i++)
	    for(ll j = 1;j <= n;j++)
	        d[i][j] = 2147483647;
	for(ll i = 1;i <= m;i++)
	    scanf("%lld%lld%lld",&x,&y,&z),d[x][y] = d[y][x] = min(d[x][y],z);
	for(ll i = 1;i <= n;i++)
	{
		dis[i][0] = 2147483647;
	    for(ll j = 1;j < (1 << n);j++)
	    {
	    	if(j & (1 << (i - 1)))
	    	    continue;
	    	dis[i][j] = min(dis[i][j - (j & (-j))],d[i][yc[(j & (-j))]]);
		}
	}
	for(ll i = 1;i < (1 << n);i++)
	{
		if(i == (i & (-i)))
		    dp[i] = 0;
		else
		{
			dp[i] = LONG_LONG_MAX;
	        for(ll j = 1;j <= n;j++)
	            if(i & (1 << (j - 1)))
	                dp[i] = min(dp[i],dp[i - (1 << (j - 1))] + dis[j][i - (1 << (j - 1))]);
		}
	}
	for(ll i = (1 << n) - 1;i;i--)
	{
		ans[i] = dp[i];
	    for(ll j = 1;j <= n;j++)
	    {
	        if(i & (1 << (j - 1)))
	            continue;
	        ans[i] = min(ans[i],ans[i + (1 << (j - 1))]);
		}
	}
	scanf("%lld",&q);
	for(ll i = 1;i <= q;i++)
	{
		scanf("%lld",&k),s = 0;
		for(ll j = 1;j <= k;j++)
		    scanf("%lld",&r),s |= (1 << (r - 1));
		printf("%lld\n",ans[s]);
	}
    return 0;
}