They say that Berland has exactly two problems, fools and roads. Besides, Berland has n cities, populated by the fools and connected by the roads. All Berland roads are bidirectional. As there are many fools in Berland, between each pair of cities there is a path (or else the fools would get upset). Also, between each pair of cities there is no more than one simple path (or else the fools would get lost). 

But that is not the end of Berland's special features. In this country fools sometimes visit each other and thus spoil the roads. The fools aren't very smart, so they always use only the simple paths.

A simple path is the path which goes through every Berland city not more than once.

The Berland government knows the paths which the fools use. Help the government count for each road, how many distinct fools can go on it.

Note how the fools' paths are given in the input.

Input

The first line contains a single integer n (2 ≤ n ≤ 105) — the number of cities. 

Each of the next n - 1 lines contains two space-separated integers ui, vi (1 ≤ ui, vi ≤ n, ui ≠ vi), that means that there is a road connecting cities ui and vi. 

The next line contains integer k (0 ≤ k ≤ 105) — the number of pairs of fools who visit each other. 

Next k lines contain two space-separated numbers. The i-th line (i > 0) contains numbers ai, bi (1 ≤ ai, bi ≤ n). That means that the fool number 2i - 1 lives in city ai and visits the fool number 2i, who lives in city bi. The given pairs describe simple paths, because between every pair of cities there is only one simple path.

Output

Print n - 1 integer. The integers should be separated by spaces. The i-th number should equal the number of fools who can go on the i-th road. The roads are numbered starting from one in the order, in which they occur in the input.

Examples

Input

5
1 2
1 3
2 4
2 5
2
1 4
3 5


Output

2 1 1 1 


Input

5
3 4
4 5
1 4
2 4
3
2 3
1 3
3 5


Output

3 1 1 1 

Note

In the first sample the fool number one goes on the first and third road and the fool number 3 goes on the second, first and fourth ones.

In the second sample, the fools number 1, 3 and 5 go on the first road, the fool number 5 will go on the second road, on the third road goes the fool number 3, and on the fourth one goes fool number 1.
import java.io.IOException;
 import java.io.InputStream;
 import java.io.PrintWriter;
 import java.io.*;
 import java.util.*;
 import java.util.LinkedList;
 import java.math.*;
 import java.lang.*;
 import java.util.PriorityQueue;
 import static java.lang.Math.*;
 @SuppressWarnings("unchecked")
 public class Solution implements Runnable {
     static class InputReader {
         private InputStream stream;
         private byte[] buf = new byte[1024];
         private int curChar;
         private int numChars;
         private SpaceCharFilter filter;
         private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

         public InputReader(InputStream stream) {
             this.stream = stream;
         }

         public int read() {
             if (numChars==-1)
                 throw new InputMismatchException();

             if (curChar >= numChars) {
                 curChar = 0;
                 try {
                     numChars = stream.read(buf);
                 }
                 catch (IOException e) {
                     throw new InputMismatchException();
                 }

                 if(numChars <= 0)
                     return -1;
             }
             return buf[curChar++];
         }

         public String nextLine() {
             String str = "";
             try {
                 str = br.readLine();
             }
             catch (IOException e) {
                 e.printStackTrace();
             }
             return str;
         }
         public int nextInt() {
             int c = read();

             while(isSpaceChar(c))
                 c = read();

             int sgn = 1;

             if (c == '-') {
                 sgn = -1;
                 c = read();
             }

             int res = 0;
             do {
                 if(c<'0'||c>'9')
                     throw new InputMismatchException();
                 res *= 10;
                 res += c - '0';
                 c = read();
             }
             while (!isSpaceChar(c));

             return res * sgn;
         }

         public long nextLong() {
             int c = read();
             while (isSpaceChar(c))
                 c = read();
             int sgn = 1;
             if (c == '-') {
                 sgn = -1;
                 c = read();
             }
             long res = 0;

             do {
                 if (c < '0' || c > '9')
                     throw new InputMismatchException();
                 res *= 10;
                 res += c - '0';
                 c = read();
             }
             while (!isSpaceChar(c));
                 return res * sgn;
         }

         public double nextDouble() {
             int c = read();
             while (isSpaceChar(c))
                 c = read();
             int sgn = 1;
             if (c == '-') {
                 sgn = -1;
                 c = read();
             }
             double res = 0;
             while (!isSpaceChar(c) && c != '.') {
                 if (c == 'e' || c == 'E')
                     return res * Math.pow(10, nextInt());
                 if (c < '0' || c > '9')
                     throw new InputMismatchException();
                 res *= 10;
                 res += c - '0';
                 c = read();
             }
             if (c == '.') {
                 c = read();
                 double m = 1;
                 while (!isSpaceChar(c)) {
                     if (c == 'e' || c == 'E')
                         return res * Math.pow(10, nextInt());
                     if (c < '0' || c > '9')
                         throw new InputMismatchException();
                     m /= 10;
                     res += (c - '0') * m;
                     c = read();
                 }
             }
             return res * sgn;
         }

         public String readString() {
             int c = read();
             while (isSpaceChar(c))
                 c = read();
             StringBuilder res = new StringBuilder();
             do {
                 res.appendCodePoint(c);
                 c = read();
             }
             while (!isSpaceChar(c));

             return res.toString();
         }

         public boolean isSpaceChar(int c) {
             if (filter != null)
                 return filter.isSpaceChar(c);
             return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
         }

         public String next() {
             return readString();
         }

         public interface SpaceCharFilter {
             public boolean isSpaceChar(int ch);
         }
     }
     public static long min(long a,long b)
     {
         if(a>b)
         {
             return b;
         }
         return a;
     }
     public static int min(int a,int b)
     {
         if(a>b)
         {
             return b;
         }
         return a;
     }
     public static long max(long a,long b)
     {
         if(a>b)
         {
             return a;
         }
         return b;
     }
     public static int max(int a,int b)
     {
         if(a>b)
         {
             return a;
         }
         return b;
     }
     static class pair implements Comparable<pair>
     {
       int x;
       int y;
       pair(int x,int y)
       {
         this.x = x;
         this.y = y;
       }
       public int compareTo(pair p)
       {
         return this.x-p.x;
       }
     }
     public static int gcd(int a,int b)
     {
         if(a==0)
         return b;
         if(b==0)
         return a;
         while((a%=b)!=0&&(b%=a)!=0);
         return a^b;
     }
     public static int mod(int a)
     {
       if(a>0)
         return a;
       return -a;
     }
     static int mod = (int)1e9+7;
     public static long expo(long exp,long pow)
     {
       long ans = 1;
       while(pow!=0)
       {
         if((pow&1)==1)
         {
           ans = (ans*exp)%mod;
         }
         exp = (exp*exp)%mod;
         pow = pow>>1;
       }
       return ans;
     }
     static int max = (int)1e5;
     public static long fact(int num)
     {
         if(num==0)
         {
           return 1;
         }
         return (fact(num-1)*num)%mod;
     }
     static int[] sieve;
     public static void sieve()
     {
       sieve = new int[max];
       for(int i=1;i<max;i++)
       {
         sieve[i] = i;
       }
       for(int i=2;i<max;i++)
       {
         if(sieve[i]==i)
         {
           for(int j=i*2;j<max;j+=i)
           {
             if(sieve[j]==j)
             {
               sieve[j] = i;
             }
           }
         }
       }
     }
     public static int lcm(int a,int b)
     {
       return a*b/gcd(a,b);
     }
     public static int bsearch(pair[] p,int x)
     {
       int l = 0;
       int r = p.length-1;
       while(r>l)
       {
         int mid = (l+r)/2;
         if(p[mid].y<=x)
         {
           l = mid+1;
         }
         else if(p[mid].x>x)
         {
           r = mid;
         }
         else
         {
           return 0;
         }
       }
       if(x>=p[r].x&&x<p[r].y)
       {
         return 0;
       }
       return p[r].x-x;
     }
     static int n;
     static int[] in;
     static int[] outtime;
     static int[][] up;
     static int timer = 0;
     static int[] dp;
     static int l = 0;
     static int[] edge;
     static int[] ans;
     static ArrayList<pair>[] list;
     public static void dfs1(int v,int p)
     {
       in[v] = ++timer;
       up[v][0] = p;
       for(int i=1;i<=l;i++)
       {
         up[v][i] = up[up[v][i-1]][i-1];
       }
       for(pair x:list[v])
       {
         if(x.x!=p)
         {
           dfs1(x.x,v);
           edge[x.x] = x.y;
         }
       }
       outtime[v] = ++timer;
     }
     public static boolean upper(int a,int b)
     {
       return in[a]<=in[b]&&outtime[a]>=outtime[b];
     }
     public static int lca(int a,int b)
     {
       if(upper(a,b))
       {
         return a;
       }
       if(upper(b,a))
       {
         return b;
       }
       for(int i=l;i>=0;i--)
       {
         if(!upper(up[a][i],b))
         {
           a = up[a][i];
         }
       }
       return up[a][0];
     }
     public static void dfs2(int v,int p)
     {
       for(pair x:list[v])
       {
         if(x.x!=p)
         {
           dfs2(x.x,v);
           dp[v]+=dp[x.x];
         }
       }
       ans[edge[v]] = dp[v];
     }
     public static void main(String args[]) throws Exception {
         new Thread(null, new Solution(),"Main",1<<26).start();
     }
     public void run() {
       InputReader sc  = new InputReader(System.in);
       PrintWriter out = new PrintWriter(System.out);
       int t1 = 1;
       while(t1-->0)
       {
         n = sc.nextInt();
         while((1<<l)<n)l++;
         in = new int[n+1];
         outtime = new int[n+1];
         up = new int[n+1][l+1];
         dp = new int[n+1];
         edge = new int[n+1];
         ans = new int[n+1];
         list = new ArrayList[n+1];
         for(int i=1;i<=n;i++)
         {
           list[i] = new ArrayList<>();
         }
         for(int i=1;i<n;i++)
         {
           int x = sc.nextInt();
           int y = sc.nextInt();
           list[x].add(new pair(y,i));
           list[y].add(new pair(x,i));
         }
         dfs1(1,1);
         int m = sc.nextInt();
         for(int i=0;i<m;i++)
         {
           int x = sc.nextInt();
           int y = sc.nextInt();
           dp[x]++;
           dp[y]++;
           dp[lca(x,y)]-=2;
         }
         dfs2(1,1);
         for(int i=1;i<n;i++)
         {
           out.print(ans[i]+" ");
         }
         out.println();
       }
      out.close();
   }
 }
