3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, cnt[N];
vector<array<int, 2>> adj[N];
int siz[N];
bool vis[N];
double deriv[N];
int ans1;
double ans2 = 1e20;
void dfs(int v, int p) {
  siz[v] = 1;
  for (auto u : adj[v]) {
    if (u[0] == p || vis[u[0]]) continue;
    dfs(u[0], v);
    siz[v] += siz[u[0]];
  }
}
int centroid(int v) {
  dfs(v, -1);
  int num = siz[v], p = -1;
  do {
    int nxt = -1;
    for (auto u : adj[v]) {
      if (u[0] == p || vis[u[0]]) continue;
      if (siz[u[0]] * 2 > num) nxt = u[0];
    }
    p = v, v = nxt;
  } while (~v);
  return p;
}
void calc(int v, int p, double& val, int dist, double& sum) {
  sum += pow(dist, 1.5) * cnt[v];
  val += 1.5 * pow(dist, 0.5) * cnt[v];
  for (auto u : adj[v]) {
    if (u[0] == p) continue;
    calc(u[0], v, val, dist + u[1], sum);
  }
}
void decomp(int v) {
  v = centroid(v);
  double tot = 0, sum = 0;
  for (auto u : adj[v]) {
    deriv[u[0]] = 0;
    calc(u[0], v, deriv[u[0]], u[1], sum);
    tot += deriv[u[0]];
  }
  if (sum < ans2) ans1 = v, ans2 = sum;
  vis[v] = 1;
  for (auto u : adj[v]) {
    if (vis[u[0]]) continue;
    if (tot - 2 * deriv[u[0]] >= 0) continue;
    decomp(u[0]);
    break;
  }
}
int main() {
  cout << fixed << setprecision(10);
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> cnt[i];
  for (int i = 0; i < n - 1; i++) {
    int a, b, w;
    cin >> a >> b >> w;
    --a;
    --b;
    adj[a].push_back({b, w});
    adj[b].push_back({a, w});
  }
  decomp(0);
  cout << ans1 + 1 << " " << ans2 << endl;
}
