#include <bits/stdc++.h>
#define ll long long
#define N 200010
namespace IO{
    #define BUF_SIZE (1<<16)
    #define OUT_SIZE (1<<16)
    bool IOerror=0;
    inline char nc(){static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;if(p1==pend){p1=buf;pend=buf+fread(buf,1,BUF_SIZE,stdin);if(pend==p1)return IOerror=1,-1;}return *p1++;}
    inline bool blank(char ch){return ch==' '||ch=='\n'||ch=='\r'||ch=='\t';}
    inline void read(int &x){bool sign=0;char ch=nc();x=0;for(;blank(ch);ch=nc());if(IOerror)return;if(ch=='-')sign=1,ch=nc();for(;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0';if(sign)x=-x;}
    inline void read(ll &x){bool sign=0;char ch=nc();x=0;for(;blank(ch);ch=nc());if(IOerror)return;if(ch=='-')sign=1,ch=nc();for(;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0';if(sign)x=-x;}
    inline void read(char *s){char ch=nc();for(;blank(ch);ch=nc());if(IOerror)return;for(;!blank(ch)&&!IOerror;ch=nc())*s++=ch;*s=0;}
    inline void read(char &c){for(c=nc();blank(c);c=nc());if(IOerror){c=-1;return;}}
    struct Ostream_fwrite{
        char *buf,*p1,*pend;
        Ostream_fwrite(){buf=new char[BUF_SIZE];p1=buf;pend=buf+BUF_SIZE;}
        inline void out(char ch){if(p1==pend){fwrite(buf,1,BUF_SIZE,stdout);p1=buf;}*p1++=ch;}
        inline void print(int x){static char s[15],*s1;s1=s;if(!x)*s1++='0';if(x<0)out('-'),x=-x;while(x)*s1++=x%10+'0',x/=10;while(s1--!=s)out(*s1);}
        inline void println(int x){print(x);out('\n');}
        inline void print(ll x){static char s[25],*s1;s1=s;if(!x)*s1++='0';if(x<0)out('-'),x=-x;while(x)*s1++=x%10+'0',x/=10;while(s1--!=s)out(*s1);}
        inline void println(ll x){print(x);out('\n');}
        inline void print(char *s){while(*s)out(*s++);}
        inline void println(char *s){while(*s)out(*s++);out('\n');}
        inline void flush(){if(p1!=buf){fwrite(buf,1,p1-buf,stdout);p1=buf;}}
        ~Ostream_fwrite(){flush();}
    }Ostream;
    inline void print(int x){Ostream.print(x);}
    inline void println(int x){Ostream.println(x);}
    inline void print(char x){Ostream.out(x);}
    inline void println(char x){Ostream.out(x);Ostream.out('\n');}
    inline void print(ll x){Ostream.print(x);}
    inline void println(ll x){Ostream.println(x);}
    inline void print(char *s){Ostream.print(s);}
    inline void println(char *s){Ostream.println(s);}
    inline void println(){Ostream.out('\n');}
    inline void flush(){Ostream.flush();}
    #undef OUT_SIZE
    #undef BUF_SIZE
}using namespace IO;
int T,n,m,root[N],head[N],tot_edge,head1[N],tot_edge1;
ll ans;
struct edge{int v;ll w;int ne;}b[N];
void add_edge(int u,int v,ll w){
	b[++tot_edge]=(edge){v,w,head[u]};
	head[u]=tot_edge;
}
struct edge1{int v,ne;}b1[N];
void add_edge1(int u,int v){
	b1[++tot_edge1]=(edge1){v,head1[u]};
	head1[u]=tot_edge1;
}
/*
struct _{
	int dfn[N],f[N][17],L[N],tot=0,d[N],fa[N][17];
	ll d1[N];
	void dfs(int x){
		dfn[x]=++tot;
		f[tot][0]=x;
		for(int i=head[x];i;i=b[i].ne){
			int v=b[i].v;
			d[v]=d[x]+1;
			d1[v]=d1[x]+b[i].w;
			fa[v][0]=x;
			dfs(v);
			f[++tot][0]=x;
		}
	}
	void swap(int &a,int &b){int w=a;a=b;b=w;}
	int cmp(int x,int y){return d[x]<d[y]?x:y;}
	int ask_lca(int x,int y){
		x=dfn[x];y=dfn[y];if(x>y)swap(x,y);
		return cmp(f[x][L[y-x+1]],f[y-(1<<L[y-x+1])+1][L[y-x+1]]);
	}
	int ask_kthfa(int u,int v){int k=d[u]-d[v]-1;for(int i=0;k;i++,k>>=1)if(k&1)u=fa[u][i];return u;}
	void init(){for(int i=2;i<=100000;i++)L[i]=L[i>>1]+1;}
	void mian(){
		tot=0;d[1]=1;dfs(1);
		for(int j=1;(1<<j)<=tot;j++)for(int i=1;i+(1<<j)-1<=tot;i++)f[i][j]=cmp(f[i][j-1],f[i+(1<<(j-1))][j-1]);
		for(int j=1;(1<<j)<=n;j++)for(int i=1;i<=n;i++)fa[i][j]=fa[fa[i][j-1]][j-1];
	}
	ll ask_dis(int x,int y){return d1[x]+d1[y]-(d1[ask_lca(x,y)]<<1);}
}LCA;
*/
struct _1{
	int d[N],s[N],son[N],top[N],id[N],dui[N],tot=0,fa[N];
	ll d1[N];
	void dfs1(int x){
		s[x]=1;son[x]=0;
		for(int i=head[x];i;i=b[i].ne){
			int v=b[i].v;
			d[v]=d[x]+1;d1[v]=d1[x]+b[i].w;
			fa[v]=x;
			dfs1(v);
			s[x]+=s[v];
			if(s[v]>s[son[x]])son[x]=v;
		}
	}
	void dfs2(int x){
		id[x]=++tot;
		dui[tot]=x;
		if(!son[x])return ;
		top[son[x]]=top[x];dfs2(son[x]);
		for(int i=head[x];i;i=b[i].ne){
			int v=b[i].v;
			if(v!=son[x]){top[v]=v;dfs2(v);}
		}
	}
	int ask_kthfa(int x,int v){
		while(d[fa[top[x]]]>d[v])x=fa[top[x]];
		return dui[id[x]-(d[x]-d[v]-1)];
	}
	int ask_lca(int x,int y){
		while(top[x]!=top[y])d[top[x]]>d[top[y]]?x=fa[top[x]]:y=fa[top[y]];
		return d[x]<d[y]?x:y;
	}
	ll ask_dis(int x,int y){return d1[x]+d1[y]-(d1[ask_lca(x,y)]<<1);}
	void mian(){
		tot=0;
		d[1]=1;dfs1(1);
		top[1]=1;dfs2(1);
	}
}LCA;
inline ll max(ll x,ll y){ll m=(x-y)>>63;return (y&m)|(x&~m);}
struct info{
	int u;ll v;
	inline friend ll operator+(info &x,info &y){return x.v+y.v+LCA.ask_dis(x.u,y.u);}
};
struct node{
	info x,y;
	inline friend node operator+(node &a,node &b){
		if(!a.x.u)return b;
		if(!b.x.u)return a;
		info x1=a.x,x2=a.y,x3=b.x,x4=b.y;
		ll w12=x1+x2;
		ll w13=x1+x3;
		ll w14=x1+x4;
		ll w23=x2+x3;
		ll w24=x2+x4;
		ll w34=x3+x4;
		ll maxn=std::max({w12,w13,w14,w23,w24,w34});
		if(w12==maxn)return (node){x1,x2};
		if(w13==maxn)return (node){x1,x3};
		if(w14==maxn)return (node){x1,x4};
		if(w23==maxn)return (node){x2,x3};
		if(w24==maxn)return (node){x2,x4};
		return (node){x3,x4};
	}
	inline friend node operator^(node &a,node &b){
		if(!a.x.u||!b.x.u)return {{0,0},{0,0}};
		info x1=a.x,x2=a.y,x3=b.x,x4=b.y;
		ll w13=x1+x3;
		ll w14=x1+x4;
		ll w23=x2+x3;
		ll w24=x2+x4;
		ll maxn=std::max({w13,w14,w23,w24});
		if(w13==maxn)return (node){x1,x3};
		if(w14==maxn)return (node){x1,x4};
		if(w23==maxn)return (node){x2,x3};
		return (node){x2,x4};
	}
	inline void del(){x.u=y.u=0;}
	inline ll val(){return x+y;}
	inline bool check(){return x.u&&y.u;}
};
struct node1{
	int ls,rs;
	node w;
	inline void del(){ls=rs=0;w.del();}
}t[N<<5];
int tot=0;
void refresh(int x){t[x].w=t[t[x].ls].w+t[t[x].rs].w;}
int insert(int l,int r,int L,info w1){
	int x=++tot;
	if(l==r){t[x].w.x=t[x].w.y=w1;return x;}
	int mid=(l+r)>>1;
	if(mid>=L)t[x].ls=insert(l,mid,L,w1);
	else t[x].rs=insert(mid+1,r,L,w1);
	refresh(x);return x;
}
void merge(int &x,int y){
	if(!x||!y){x|=y;return ;}
	merge(t[x].ls,t[y].ls);
	merge(t[x].rs,t[y].rs);
	refresh(x);
}
void erase(int x,int l,int r,int L){
	if(l==r){t[x].w.del();return ;}
	int mid=(l+r)>>1;
	if(mid>=L)erase(t[x].ls,l,mid,L);
	else erase(t[x].rs,mid+1,r,L);
	refresh(x);
}
void dfs(int x){
	for(int i=head[x];i;i=b[i].ne){
		int v=b[i].v;
		dfs(v);
		node w=t[root[x]].w^t[root[v]].w;
		if(w.check())ans=max(ans,w.val()-(LCA.d1[x]<<1));
		merge(root[x],root[v]);
	}
	for(int i=head1[x];i;i=b1[i].ne)erase(root[x],1,m,b1[i].v);
}
int main(){
//	freopen("ex_center4.in","r",stdin);
//	freopen("data.out","w",stdout);
//	LCA.init();
	read(T);
	while(T--)
	{
		ans=-1e17;
		read(n);
		for(int i=1;i<=n;i++)head[i]=head1[i]=root[i]=0;
		tot_edge=tot_edge1=0;
		for(int i=1;i<n;i++){int u,v;ll w;read(u);read(v);read(w);add_edge(u,v,w);}
		LCA.mian();
		read(m);
		for(int i=1;i<=m;i++){
			int u,v;ll y;
			read(u);read(v);read(y);
			if(u==v)continue; 
			int t1=LCA.ask_lca(u,v);
			if(u!=t1){
				int rt=insert(1,m,i,{v,LCA.ask_dis(u,v)-(y<<1)+LCA.d1[u]});
				node w=t[rt].w^t[root[u]].w;
				if(w.check())ans=max(ans,w.val()-(LCA.d1[u]<<1));
				merge(root[u],rt);
				add_edge1(LCA.ask_kthfa(u,t1),i);
			}
			if(v!=t1){
				int rt=insert(1,m,i,{u,LCA.ask_dis(u,v)-(y<<1)+LCA.d1[v]});
				node w=t[rt].w^t[root[v]].w;
				if(w.check())ans=max(ans,w.val()-(LCA.d1[v]<<1));
				merge(root[v],rt);
				add_edge1(LCA.ask_kthfa(v,t1),i);
			}
		}
		dfs(1);
		if(ans<(-1e16))print('F');
		else print(ans>>1);
		print('\n');
		for(int i=1;i<=tot;i++)t[i].del();
		tot=0;
	}	
	flush();
	return 0;
}