//入力チェック+連結確認
#include <iostream>
#include <algorithm>
#include <atcoder/all>
#include <queue>
#include <set>
#include <cassert>
using namespace std;
using namespace atcoder;
using ll = long long;
//#define endl "\n";
ll N, M, L;
vector<vector<int>> G;
set<pair<ll,ll>> st;

int main(){
  cin >> N >> M;
  G.resize(N + 1);
  dsu d(N + 1);
  for(int i = 0; i < M; i++){
    ll a, b;
    cin >> a >> b;
    if(a > b) swap(a, b);
    G[a].push_back(b);
    G[b].push_back(a);
    assert(a != b);
    assert(st.find({a, b}) == st.end());
    st.insert({a, b});
    d.merge(a, b);
  }
  cin >> L;
  vector<ll> chk(N + 1, -1);
  for(int i = 0; i < L; i++){
    ll j, k;
    cin >> j >> k;
    chk[j] = k;
  }
  if(d.same(1, N) == true) cout << "T" << endl;
  else cout << "F" << endl;
  return 0;
}