#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int INF = 9999999;
long long a, b, c, d, e, f, n, m, k, l;
void createTree(vector<int> &parents, vector<int> &level,
                vector<vector<int> > &mezoblebi) {
  queue<pair<pair<int, int>, int> > q;
  q.push({{1, 1}, 0});
  level[1] = 0;
  while (!q.empty()) {
    int from = q.front().first.first;
    int to = q.front().first.second;
    int lvl = q.front().second;
    q.pop();
    parents[to] = from;
    level[to] = lvl;
    for (int i = 0; i < mezoblebi[to].size(); i++) {
      int newTo = mezoblebi[to][i];
      if (newTo != from) {
        q.push({{to, newTo}, lvl + 1});
      }
    }
  }
}
void makeEdge(vector<vector<int> > &grid, int from, int to, vector<int> &level,
              vector<int> &parent, int value) {
  while (from != to) {
    if (level[from] > level[to]) {
      grid[from][parent[from]] = max(value, grid[from][parent[from]]);
      grid[parent[from]][from] = grid[from][parent[from]];
      from = parent[from];
    } else if (level[from] < level[to]) {
      grid[parent[to]][to] = max(value, grid[parent[to]][to]);
      grid[to][parent[to]] = grid[parent[to]][to];
      to = parent[to];
    } else {
      grid[parent[to]][to] = max(value, grid[parent[to]][to]);
      grid[to][parent[to]] = grid[parent[to]][to];
      grid[from][parent[from]] = max(value, grid[from][parent[from]]);
      grid[parent[from]][from] = grid[from][parent[from]];
      from = parent[from];
      to = parent[to];
    }
  }
}
bool check(vector<vector<int> > &grid, int from, int to, vector<int> &level,
           vector<int> &parent, int value) {
  int minBefore = 99999999;
  while (from != to) {
    if (level[from] > level[to]) {
      minBefore = min(minBefore, grid[from][parent[from]]);
      from = parent[from];
    } else if (level[from] < level[to]) {
      minBefore = min(grid[to][parent[to]], minBefore);
      to = parent[to];
    } else {
      minBefore = min(minBefore, grid[from][parent[from]]);
      minBefore = min(grid[to][parent[to]], minBefore);
      from = parent[from];
      to = parent[to];
    }
  }
  if (value == minBefore) return true;
  return false;
}
int main() {
  int wveroebi;
  cin >> wveroebi;
  vector<pair<int, int> > wiboebi;
  vector<vector<int> > grid(wveroebi + 1);
  vector<vector<int> > mezoblebi(wveroebi + 1);
  for (int i = 0; i <= wveroebi; i++) {
    for (int j = 0; j <= wveroebi; j++) {
      grid[i].push_back(1);
    }
  }
  for (int i = 0; i < wveroebi - 1; i++) {
    int from, to;
    cin >> from >> to;
    wiboebi.push_back({from, to});
    mezoblebi[to].push_back(from);
    mezoblebi[from].push_back(to);
  }
  int q;
  cin >> q;
  vector<pair<pair<int, int>, int> > saboloo(q);
  for (int i = 0; i < q; i++) {
    int from, to, wona;
    cin >> from >> to >> wona;
    saboloo[i] = {{from, to}, wona};
  }
  vector<int> parents(wveroebi + 1, 1);
  vector<int> level(wveroebi + 1, 1);
  createTree(parents, level, mezoblebi);
  for (int i = 0; i < q; i++) {
    int from = saboloo[i].first.first;
    int to = saboloo[i].first.second;
    int value = saboloo[i].second;
    makeEdge(grid, from, to, level, parents, value);
  }
  bool flag = true;
  for (int i = 0; i < q; i++) {
    int from = saboloo[i].first.first;
    int to = saboloo[i].first.second;
    int value = saboloo[i].second;
    if (!check(grid, from, to, level, parents, value)) {
      flag = false;
      break;
    }
  }
  if (!flag) {
    cout << -1;
  } else {
    for (int i = 0; i < wveroebi - 1; i++) {
      int from = wiboebi[i].first;
      int to = wiboebi[i].second;
      cout << grid[from][to] << " ";
    }
  }
  return 0;
}
