#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
#define N 40100int fa[N],q;struct DR
{int x,y;
}dr[N],to[27];struct ROAD
{int u,v;int x,y;
}road[N];struct QUERY
{int a,b,time;int id,res;
}query[N];void makeset(int n)
{for(int i=1;i<=n;i++){fa[i] = i;dr[i].x = dr[i].y = 0;}
}int findset(int x)
{if(x != fa[x]){int tmp = fa[x];fa[x] = findset(fa[x]);dr[x].x += dr[tmp].x;dr[x].y += dr[tmp].y;}return fa[x];
}void unionset(int index)  //合并第index条边
{ROAD r = road[index];int x = findset(r.u);int y = findset(r.v);if(x == y)return;fa[x] = y;dr[x].x = r.x - dr[r.u].x + dr[r.v].x;   // x->y <==> u->v - u->x + v->ydr[x].y = r.y - dr[r.u].y + dr[r.v].y;
}int cmp1(QUERY ka,QUERY kb)
{return ka.time<kb.time;
}int cmp2(QUERY ka,QUERY kb)
{return ka.id<kb.id;
}void InitDirection()
{to['E'-'A'].x = 1;to['E'-'A'].y = 0;to['W'-'A'].x = -1;to['W'-'A'].y = 0;to['N'-'A'].x = 0;to['N'-'A'].y = 1;to['S'-'A'].x = 0;to['S'-'A'].y = -1;
}void read()
{int n,m,i,dis;char ss[4];InitDirection();scanf("%d%d",&n,&m);makeset(n);for(i=1;i<=m;i++){scanf("%d%d%d %s",&road[i].u,&road[i].v,&dis,ss);road[i].x = dis*(to[ss[0]-'A'].x);road[i].y = dis*(to[ss[0]-'A'].y);}scanf("%d",&q);for(i=1;i<=q;i++){scanf("%d%d%d",&query[i].a,&query[i].b,&query[i].time);query[i].id = i;}sort(query+1,query+q+1,cmp1);
}void solve()
{int i,j;j=1;for(i=1;i<=q;i++){for(;j<=query[i].time;j++){unionset(j);}if(findset(query[i].a) != findset(query[i].b))query[i].res = -1;elsequery[i].res = abs(dr[query[i].a].x-dr[query[i].b].x) + abs(dr[query[i].a].y-dr[query[i].b].y);}sort(query+1,query+q+1,cmp2);for(i=1;i<=q;i++)cout<<query[i].res<<endl;
}int main()
{read();solve();return 0;
}