#include <bits/stdc++.h>
using namespace std;
short int n, m, nod[5000 + 10][5000 + 10], nivel[5000 + 10], tata[5000 + 10];
int sol[5000 + 10];
bool viz[5000 + 10];
struct query {
  int x, y, c;
} q[5000 + 10];
map<pair<short int, short int>, short int> umap;
vector<pair<short int, short int> > a;
void dfs(int x) {
  viz[x] = 1;
  for (int i = 1; i <= n; i++)
    if (nod[x][i] && !viz[i]) {
      nivel[i] = nivel[x] + 1;
      tata[i] = x;
      dfs(i);
    }
}
inline bool mycmp(query a, query b) {
  if (a.c < b.c) return 1;
  if (a.c == b.c && a.x < b.x) return 1;
  if (a.c == b.c && a.x == b.x && a.y < b.y) return 1;
  return 0;
}
void LCA(int x1, int x2, int x3) {
  if (nivel[x1] < nivel[x2]) swap(x1, x2);
  while (nivel[x1] > nivel[x2]) {
    int t = tata[x1];
    if (nod[x1][t]) a.push_back(make_pair(x1, t));
    x1 = t;
  }
  while (x1 != x2) {
    int t1 = tata[x1], t2 = tata[x2];
    if (nod[x1][t1]) a.push_back(make_pair(x1, t1));
    if (nod[x2][t2]) a.push_back(make_pair(x2, t2));
    x1 = t1;
    x2 = t2;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i < n; i++) {
    int nod1, nod2;
    cin >> nod1 >> nod2;
    umap[make_pair(nod1, nod2)] = umap[make_pair(nod2, nod1)] = i;
    sol[i] = 1000000;
    nod[nod1][nod2] = nod[nod2][nod1] = 1;
  }
  nivel[1] = 1;
  dfs(1);
  cin >> m;
  for (int i = 1; i <= m; i++) {
    cin >> q[i].x >> q[i].y >> q[i].c;
    if (q[i].x > q[i].y) swap(q[i].x, q[i].y);
  }
  sort(q + 1, q + m + 1, mycmp);
  int i = m;
  while (i) {
    a.clear();
    int val = q[i].c;
    while (i && q[i].c == val) {
      if (q[i].x == q[i + 1].x && q[i].y == q[i + 1].y &&
          q[i].c == q[i + 1].c) {
        i--;
        continue;
      }
      int cnt = a.size();
      LCA(q[i].x, q[i].y, q[i].c);
      if (a.size() == cnt) {
        cout << -1 << '\n';
        return 0;
      }
      i--;
    }
    for (int i = 0; i < a.size(); i++) {
      nod[a[i].first][a[i].second] = nod[a[i].first][a[i].second] = 0;
      sol[umap[a[i]]] = val;
    }
  }
  for (int i = 1; i < n; i++) cout << sol[i] << ' ';
  cout << '\n';
  return 0;
}
