#include<bits/stdc++.h>
using namespace std;
#define foru(i,a,b) for(int i=(a); i<=(b); ++i)
#define ford(i,a,b) for(int i=(a); i>=(b); --i)
#define rep(i,a) for(int i=0; i<(a); ++i)
#define sz(a) (int)(a).size()
#define all(a) (a).begin(),(a).end()
#define bit(s,i) (((s)>>(i))&1)
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define fi first
#define se second
#define ll long long
#define eb emplace_back
#define pb push_back
#define __builtin_popcount __builtin_popcountll
#define _ << " " <<
template <class X, class Y> bool maxi(X &x, Y y){return x<y?x=y,true:false;}
template <class X, class Y> bool mini(X &x, Y y){return x>y?x=y,true:false;}
const int N=3e5+5;
int n,e,id[N],tin[N],tout[N],tim,par[N];
int ae[N],be[N]; bool inR[N];
vii adj[N];
void dfs(int u, int p=-1){
tin[u]=++tim;
for(auto [v,j]:adj[u]) if(v!=p){
id[v]=j;
par[v]=u;
dfs(v,u);
}
tout[u]=tim;
}
bool chk(int r, int u){
return (tin[r] <= tin[u] && tout[u] <= tout[r]);
}
int parD[N];
int find(int a){
return parD[a]==a ? a : parD[a]=find(parD[a]);
}
void unite(int a, int b){
a=find(a); b=find(b);
if(a!=b){
parD[b]=a;
}
}
int per[N];
void solve(){
cin>>n>>e;
foru(i,1,e){
cin>>ae[i]>>be[i];
}
foru(i,1,n-1){
int x; cin>>x;
adj[ae[x]].eb(be[x],x);
adj[be[x]].eb(ae[x],x);
inR[x]=1;
}
iota(parD,parD+1+n,0);
dfs(1);
int lastUsed=0;
foru(i,1,e){
if(!inR[i]){
int x=find(ae[i]), y=find(be[i]);
vi ds;
while(x>0&&!chk(x,y)){
ds.eb(id[x]);
parD[x]=par[x];
x=find(x);
}
while(y>0&&!chk(y,x)){
ds.eb(id[y]);
parD[y]=par[y];
y=find(y);
}
sort(all(ds));
for(int j:ds) per[j]=++lastUsed;
per[i]=++lastUsed;
} else{
if(par[ae[i]]==be[i]) swap(ae[i],be[i]);
if(find(be[i])==be[i]){
per[i]=++lastUsed;
parD[be[i]]=ae[i];
}
}
}
foru(i,1,e) cout<<per[i]<<" ";
cout<<'\n';
}
int32_t main(){
#define task "test"
if(fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
cin.tie(0)->sync_with_stdio(0);
int tc=1; //cin>>tc;
foru(i,1,tc){
solve();
}
}
