#include<cstdio>

#include<algorithm>

#define setfire(name) freopen(#name".in","r",stdin);freopen(#name".out","w",stdout);

using namespace std;

const int N=+;

struct M{

    int u,v,w;

}e[N*];

int n,m,ans,cas,belong[N];

bool cmp(const M &a,const M &b){

    return a.w<b.w;

}

int main(){

    setfire(set);

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

    for(int i=;i<=m;i++) scanf("%d%d%d",&e[i].u,&e[i].v,&e[i].w);

    sort(e+,e+m+,cmp);

    for(int i=;i<=n;i++) belong[i]=;

    scanf("%d",&cas);char s[];

    for(int i=,x;i<=cas;i++){

        scanf("%s",s);

        if(s[]=='M'){

            scanf("%d",&x);

            if(s[]=='A'){

                belong[x]=;

            }

            else if(s[]=='B'){

                belong[x]=;

            }

            else if(s[]=='C'){

                belong[x]=;

            }

        }

        else{

            ans=0x3f3f3f3f;

            if(s[]=='A'&&s[]=='A'){

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

                    if(belong[e[i].u]==&&belong[e[i].v]==){

                        ans=e[i].w;

                        break;

                    }

                }

            }

            else if(s[]=='A'&&s[]=='B'){

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

                    if(belong[e[i].u]==&&belong[e[i].v]==

                      ||belong[e[i].u]==&&belong[e[i].v]==){

                        ans=e[i].w;

                        break;

                    }

                }

            }

            else if(s[]=='A'&&s[]=='C'){

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

                    if(belong[e[i].u]==&&belong[e[i].v]==

                      ||belong[e[i].u]==&&belong[e[i].v]==){

                        ans=e[i].w;

                        break;

                    }

                }

            }

            else if(s[]=='B'&&s[]=='B'){

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

                    if(belong[e[i].u]==&&belong[e[i].v]==){

                        ans=e[i].w;

                        break;

                    }

                }

            }

            else if(s[]=='B'&&s[]=='C'){

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

                    if(belong[e[i].u]==&&belong[e[i].v]==

                      ||belong[e[i].u]==&&belong[e[i].v]==){

                        ans=e[i].w;

                        break;

                    }

                }

            }

            else if(s[]=='C'&&s[]=='C'){

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

                    if(belong[e[i].u]==&&belong[e[i].v]==){

                        ans=e[i].w;

                        break;

                    }

                }

            }

            if(ans==0x3f3f3f3f) puts("No Found!");

            else printf("%d\n",ans);

        }

    }

    return ;

}